Partial Functions and Equality in Answer Set Programming

DOI10.1007/978-3-540-89982-2_36zbMath1185.68149OpenAlexW2123964226MaRDI QIDQ5504669

Pedro Cabalar

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_36

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Related Items (2)

Synonymous theories and knowledge representations in answer set programming ⋮ P-log: refinement and a new coherency condition

Cites Work

• Unnamed Item
• A logic covering undefinedness in program proofs
• Reasoning with infinite stable models
• Circumscription - a form of non-monotonic reasoning
• Flattening and saturation: Two representation changes for generalization
• Algebraic semantics for functional logic programming with polymorphic order-sorted types
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Representing action and change by logic programs
• The integration of functions into logic programming: From theory to practice
• Logics in Artificial Intelligence
• Logics in Artificial Intelligence
• A Characterization of Strong Equivalence for Logic Programs with Variables

This page was built for publication: Partial Functions and Equality in Answer Set Programming