Partial Functions and Equality in Answer Set Programming
From MaRDI portal
Recommendations
- Functional answer set programming
- A Free Logic for Stable Models with Partial Intensional Functions
- A ``conservative approach to extending answer set programming with non-Herbrand functions
- ASP with non-herbrand partial functions: a language and system for practical use
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
Cites work
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- A Characterization of Strong Equivalence for Logic Programs with Variables
- A logic covering undefinedness in program proofs
- Algebraic semantics for functional logic programming with polymorphic order-sorted types
- Circumscription - a form of non-monotonic reasoning
- Flattening and saturation: Two representation changes for generalization
- scientific article; zbMATH DE number 1884395 (Why is no real title available?)
- Logics in Artificial Intelligence
- Logics in Artificial Intelligence
- Reasoning with infinite stable models
- Representing action and change by logic programs
- The integration of functions into logic programming: From theory to practice
Cited in
(10)- Partial functions in ACL2
- Equivalence between answer-set programs under (partially) fixed input
- P-log: refinement and a new coherency condition
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
- A ``conservative approach to extending answer set programming with non-Herbrand functions
- Functional answer set programming
- Synonymous theories and knowledge representations in answer set programming
- Adding partial functions to constraint logic programming with sets
- Towards systematic treatment of partial functions in knowledge representation
- A prudent logic of partial functions
This page was built for publication: Partial Functions and Equality in Answer Set Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504669)
