A general framework for preferences in answer set programming

DOI10.1016/J.ARTINT.2023.104023MaRDI QIDQ6067052zbMATH OpenFDO

Authors Gerhard Brewka, James Delgrande, Javier Romero, Torsten Schaub

Publication date 14 December 2023

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2023.104023

zbMATH Keywords

optimizationpreferencesanswer-set programming

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Implementing preferences with asprin
• A framework for compiling preferences in logic programs
• A semantic framework for preference handling in answer set programming
• Computing Diverse Optimal Stable Models
• scientific article; zbMATH DE number 1844462

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• A language-independent framework for reasoning about preferences for declarative problem solving
• A logical characterization of the preferred models of logic programs with ordered disjunction
• ASP and subset minimality: enumeration, cautious reasoning and MUSes
• ASP for minimal entailment in a rational extension of SROEL
• ASP-Core-2 input language format
• Abduction from logic programs: Semantics and complexity
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases
• An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
• Answer set programming as a modeling language for course timetabling
• Combining approaches for solving satisfiability problems with qualitative preferences
• Complex optimization in answer set programming
• Conflict-Driven Answer Set Enumeration
• Declarative algorithms and complexity results for assumption-based argumentation
• Extending and implementing the stable model semantics
• Finding similar/diverse solutions in answer set programming
• Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Learning conditionally lexicographic preference relations
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with stable model semantics as a constraint programming paradigm
• Logics in Artificial Intelligence
• Multi-shot ASP solving with clingo
• On the computational cost of disjunctive logic programming: Propositional case
• Optimum stable model search: algorithms and implementation
• Paraconsistency and word puzzles
• Reasoning on multirelational contextual hierarchies via answer set programming with algebraic measures
• Reasoning with Preference Trees over Combinatorial Domains
• Solving satisfiability problems with preferences
• The DLV system for knowledge representation and reasoning
• The computational complexity of dominance and consistency in CP-nets
• Unrestricted vs restricted cut in a tableau method for Boolean circuits
• \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints

Cited in

(5)

• Solving satisfiability problems with preferences
• Preference-Based Problem Solving for Constraint Programming
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Answer set programming for pattern generation in logical analysis of data
• A General Framework for Expressing Preferences in Causal Reasoning and Planning

This page was built for publication: A general framework for preferences in answer set programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067052)