A general theory of confluent rewriting systems for logic programming and its applications
From MaRDI portal
Publication:5935989
DOI10.1016/S0168-0072(00)00044-0zbMath0980.68069OpenAlexW2050655425MaRDI QIDQ5935989
Claudia Zepeda, Jürgen Dix, Mauricio Osorio
Publication date: 2 July 2001
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(00)00044-0
Database theory (68P15) Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Logic programming (68N17)
Related Items
Dealing with explicit preferences and uncertainty in answer set programming, Semantic-based construction of arguments: an answer set programming approach, Approximating agreements in formal argumentation dialogues1, A logical approach to A-Prolog, Safe beliefs for propositional theories, Semantics for Possibilistic Disjunctive Programs, Graph-based construction of minimal models, Relating defeasible and normal logic programming through transformation properties.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial models and logic programming
- Formalizing a logic for logic programming
- Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
- Computation of the semantics of autoepistemic belief theories
- Theory of partial-order programming
- A kripke-kleene semantics for logic programs*
- Set constructors, finite sets, and logical semantics
- A framework to incorporate non-monotonic reasoning into constraint logic programming
- The well-founded semantics for general logic programs
- Logic programming and knowledge representation
- Characterizations of the disjunctive stable semantics by partial evaluation
- Transformation-based bottom-up computation of the well-founded model
- Partial order programming (Revisited)
- On the equivalence of the static and disjunctive well-founded semantics and its computation
