UTCS Artificial Intelligence
courses
talks/events
demos
people
projects
publications
software/data
labs
areas
admin
Almost Definite Causal Theories (2004)
Semra Dogandag,
Paolo Ferraris
,
Vladimir Lifschitz
The language of nonmonotonic causal theories, defined by Norman McCain and Hudson Turner, is an important formalism for representing properties of actions. For causal theories of a special kind, called definite, a simple translation into the language of logic programs under the answer set semantics is available. In this paper we define a similar translation for causal theories of a more general form, called almost definite. Such theories can be used, for instance, to characterize the transitive closure of a binary relation. The new translation leads to an implementation of a subclass of almost definite causal theories that employs the answer set solver smodels as the search engine.
View:
PS
Citation:
In
Proc. LPNMR-7
, pp. 74--86 2004.
Bibtex:
@inproceedings{Dogandag:LPNMR2004, title={Almost Definite Causal Theories}, author={Semra Dogandag and Paolo Ferraris and Vladimir Lifschitz}, booktitle={Proc. LPNMR-7}, pages={74--86}, url="http://www.cs.utexas.edu/users/ai-lab?Dogandag:LPNMR2004", year={2004} }
People
Paolo Ferraris
Ph.D. Alumni
pieffe8 [at] gmail com
Vladimir Lifschitz
Faculty
vl [at] cs utexas edu
Areas of Interest
Answer Set Programming
Automated Reasoning
Causal Theories
Nonmonotonic Reasoning
Reasoning about Actions