• Corpus ID: 254583

Why did the accident happen? A norm-based reasoning approach

  title={Why did the accident happen? A norm-based reasoning approach},
  author={Farid Nouioua},
In this paper we describe an architecture of a system that answer the question : Why did the accident happen? from the textual description of an accident. We present briefly the different parts of the architecture and then we describe with more detail the semantic part of the system i.e. the part in which the norm-based reasoning is performed on the explicit knowlege extracted from the text. 


About Norms and Causes
This work proposes a method to extract norms from texts: narrative texts generally do not describe a norm, but rather the discrepancies between what actually happened, and the corresponding normal sequence of events, which is validated by designing algorithms that identify the "basic" norms in a text.
A temporal logic for reasoning about processes and plans
Much previous work in artificial intelligence has neglected representing time in all its complexity. In particular, it has neglected continuous change and the indeterminacy of the future. To rectify
Representing Knowledge about Norms
This paper applies a language to represent norms in the domain of driving, and shows that it is adequate to reason on the causes of accidents, as described by car-crash reports.
A Temporal Logic for Reasoning About Processes and Plans
A common disclaimer by an AI author is that he has neglected temporal considerations to avoid complication; the implication is nearly made that adding a temporal dimension to the research would be a familiar but tedious exercise that would obscure the new material presented by the author.
A Logic for Default Reasoning
  • R. Reiter
  • Mathematics, Computer Science
    Artif. Intell.
  • 1980
hal-00085160, version 1 -4 Oct
  • hal-00085160, version 1 -4 Oct
  • 2006
Representing Knowledge about Norms, In Proceedings/Actes
  • ECAI Conference,
  • 2004
The Stable Model Semantics for Logic Programming
This paper introduces a succinct abstract representation of constraint atoms in which a constraint atom is represented compactly and shows that this representation provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended.
A Logic for Default Reasoning, Artificial Intelli gence
  • Special Issue on Nonmonotonic Logic,
  • 1980
Scripts, Plans, Goals and Understanding Lawrence Erlbaum Ass
  • Scripts, Plans, Goals and Understanding Lawrence Erlbaum Ass
  • 1977