Enhancing ASP systems for planning with temporal constraints

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

Volumn 4483 LNAI, Issue , 2007, Pages 309-314

  Mellarkod, Veena S ^a   Gelfond, Michael ^a  

^a TEXAS TECH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING; PROLOG (PROGRAMMING LANGUAGE); SET THEORY;

ANSWER SETS; GROUND CONSTRAINT VARIABLES; KNOWLEDGE REPRESENTATION LANGUAGES; TEMPORAL CONSTRAINTS;

KNOWLEDGE REPRESENTATION;

EID: 38049012372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72200-7_31     Document Type: Conference Paper

References (8)

1. S. Baselice, P. A. Bonatti, and Michael Gelfond. Towards an integration of answer set and constraint solving. In In Proceedings of ICLP, pages 52-66, 2005.
2. Marco Bozzano et. al. The mathsat 3 system. In proc. CADE-20, Int. Conference on Automated Deduction, Jul 2005.
3. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proceedings of ICLP-88, pages 1070-1080, 1988.
4. Balduccini M. Answer Set Based Design of Highly Autonomous, Rational Agents. PhD thesis, Texas Tech University, Dec 2005.
5. Balduccini M. CR-models: An inference engine for CR-prolog. In Logic Programming and Nonmonotonic Reasoning, May 2007.
6. Balduccini M., Gelfond M., and Nogueira M. Answer set based design of knowledge systems. Annals of Mathematics and Artificial Intelligence, 2006.
7. G. Ramalingam, J. Song, L. Joscovicz, and R. Miller. Solving difference constraints incrementally. Algorithmica, 23:261-275, 1999.
8. Tommi Syrjanen. Implementation of logical grounding for logic programs with star ble model semantics. Technical Report 18, Digital Systems Laboratory, Helsinki University of Technology, 1998.