Abductive partial order planning with dependent fluents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2174, Issue , 2001, Pages 63-77

  Badea, Liviu ^a   Tilivea, Doina ^a  

^a NATIONAL INSTITUTE FOR RESEARCH AND DEVELOPMENT IN INFORMATICS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; LOGIC PROGRAMMING;

CONSTRAINT HANDLING RULES; EFFICIENT IMPLEMENTATION; PARTIAL ORDER PLANNERS; PARTIAL ORDER PLANNING; PLANNING APPLICATIONS; PLANNING DOMAINS; STATE CONSTRAINTS; SYSTEM INTEGRATION;

ARTIFICIAL INTELLIGENCE;

EID: 27144528473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45422-5_6     Document Type: Conference Paper

References (11)

1. Denecker M., Missiaen L., Bruynooghe M. Temporal reasoning with abductive event calculus, ECAI-92, 384-388.
2. Denecker M., DeSchreye D. SLDNFA: an abductive procedure for abductive logic programs, J.Logic Programming 34(2),111-167, 1998.
3. Fruewirth T. Constraint Handling Rules, in Podelski A. (ed) Constraint Programming: Basic and Trends, LNCS 910, 90-107, 1995.
4. Kakas A., Michael A., Mourlas C. ACLP: a case for non-monotonic reasoning, Proc. NM’98.
5. Kowalski R., Toni F., Wetzel G. Executing suspended logic programs, Fundamenta Informaticae 34 (1998), 1-22.
6. Lin F., Reiter R. State constraints revisited, JLC4(5), 655-678.
7. Shanahan M. An abductive event calculus planner, JLP44 (2000)
8. Kakas A., Kowalski R., Toni F. The role of abduction in logic programming, Handbook of logic in AI and LP 5, OUP1998, 235-324.
9. Kowalski R., Sadri F., Soper P. Integrity checking in deductive databases, VLDB’97.
10. Bylander T., Allemang D., Tanner M.C., Josephson J.R. The computational complexity of abduction, AIJ 49(1-3), pp. 25-60, 1991.
11. Wetzel G. Using integrity constraints as deletion rules, Proc. DYNAMICS’97, 147-161, 1997.