Preferred First-Order Answer Set Programs

DOI10.1145/2579817zbMath1291.68381OpenAlexW2036349108MaRDI QIDQ5169967

No author found.

Publication date: 17 July 2014

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2579817

zbMATH Keywords

preferencesecond-order logicanswer set programmingfirst-order nonmonotonic reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Cites Work

• Unnamed Item
• Ordered completion for first-order logic programs on finite structures
• Stable models and circumscription
• From answer set logic programming to circumscription via logic of GK
• Loop-separable programs and their first-order definability
• Closed-world databases and circumscription
• Preferred answer sets for extended logic programs
• On Reductive Semantics of Aggregates in Answer Set Programming
• Knowledge Representation, Reasoning and Declarative Problem Solving
• A framework for compiling preferences in logic programs
• A semantic framework for preference handling in answer set programming
• Logic program-based updates
• Conflict-Driven Answer Set Enumeration

This page was built for publication: Preferred First-Order Answer Set Programs