Well-founded semantics and stratification for ordered logic programs

DOI10.1007/BF03038273zbMath0798.68029OpenAlexW2066114654MaRDI QIDQ1313371

V. Pereyra

Publication date: 31 October 1994

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03038273

zbMATH Keywords

inheritanceknowledge representationwell-founded semanticsnon-monotonic reasoninglogic programmingclassical negation

Mathematics Subject Classification ID

Knowledge representation (68T30) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (1)

Well-founded semantics and stratification for ordered logic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The alternating fixpoint of logic programs with negation
• Logic programming with sets
• The generalized counting method for recursive logic queries
• Stable and extension class theory for logic programs and default logics
• Safe computation of the well-founded semantics of datalog queries
• Paraconsistent logic programming
• Well-founded semantics and stratification for ordered logic programs
• Generalized disjunctive well-founded semantics for logic programs.
• A lattice-theoretical fixpoint theorem and its applications
• On the power of magic
• A Fixpoint Semantics for Ordered Logic
• Login: a logic programming language with built-in inheritance
• A generalization of the differential approach to recursive query evaluation
• Logical foundations of object-oriented and frame-based languages
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Well-founded semantics and stratification for ordered logic programs