Preferred first-order answer set programs
From MaRDI portal
Recommendations
Cites work
- A framework for compiling preferences in logic programs
- A semantic framework for preference handling in answer set programming
- Closed-world databases and circumscription
- Conflict-Driven Answer Set Enumeration
- From answer set logic programming to circumscription via logic of GK
- scientific article; zbMATH DE number 3595177 (Why is no real title available?)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic program-based updates
- Loop-separable programs and their first-order definability
- On Reductive Semantics of Aggregates in Answer Set Programming
- Ordered completion for first-order logic programs on finite structures
- Preferred answer sets for extended logic programs
- Stable models and circumscription
Cited in
(6)- A progression semantics for first-order logic programs
- A selective semantics for logic programs with preferences
- Preferred answer sets for ordered logic programs
- First-order Answer Set Programming as Constructive Proof Search
- scientific article; zbMATH DE number 1931679 (Why is no real title available?)
- A semantic framework for preference handling in answer set programming
This page was built for publication: Preferred first-order answer set programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169967)