A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions
From MaRDI portal
Publication:2900504
DOI10.1007/978-3-642-30743-0_3zbMath1248.68468MaRDI QIDQ2900504
Publication date: 23 July 2012
Published in: Correct Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30743-0_3
nonmonotonic reasoning; logic programming; answer set programming; stable models; many-to-one functions; non-Herbrand functions
68T27: Logic in artificial intelligence
68T30: Knowledge representation
68T37: Reasoning under uncertainty in the context of artificial intelligence
68N17: Logic programming
Related Items
P-log: refinement and a new coherency condition, First-order stable model semantics with intensional functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Functional answer set programming
- A decidable subclass of finitary programs
- Probabilistic reasoning with answer sets
- Weight Constraint Programs with Functions
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Constraint Answer Set Solving
- Diagnostic reasoning with A-Prolog