Representing Transition Systems by Logic Programs
Authors:
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 92-106
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Action Languages, Answer Sets, and Planning1999
- Simplifying superstring action on AdS5 × S5Journal of High Energy Physics, 1998
- Representing actions in logic programs and default theories a situation calculus approachThe Journal of Logic Programming, 1997
- Encoding planning problems in nonmonotonic logic programsLecture Notes in Computer Science, 1997
- SATO: An efficient propositional prover1997
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Negation as Failure1978