A general framework for preferences in answer set programming

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

Cites Work

Title not available (Why is that?)
Multi-shot ASP solving with clingo
Extending and implementing the stable model semantics
On the computational cost of disjunctive logic programming: Propositional case
Title not available (Why is that?)
Title not available (Why is that?)
Knowledge Representation, Reasoning and Declarative Problem Solving
The DLV system for knowledge representation and reasoning
Logic Programming and Nonmonotonic Reasoning
Solving satisfiability problems with preferences
Combining approaches for solving satisfiability problems with qualitative preferences
Logic programs with stable model semantics as a constraint programming paradigm
Learning conditionally lexicographic preference relations
Finding similar/diverse solutions in answer set programming
Answer set programming as a modeling language for course timetabling
Conflict-Driven Answer Set Enumeration
Complex optimization in answer set programming
Declarative Algorithms and Complexity Results for Assumption-Based Argumentation
Title not available (Why is that?)
Algorithms for Solving Satisfiability Problems with Qualitative Preferences
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Abduction from logic programs: Semantics and complexity
Logics in Artificial Intelligence
Optimum stable model search: algorithms and implementation
A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
ASP-Core-2 Input Language Format
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
A language-independent framework for reasoning about preferences for declarative problem solving
Reasoning with Preference Trees over Combinatorial Domains
ASP for minimal entailment in a rational extension of SROEL
ASP (): Answer Set Programming with Algebraic Constraints
Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics
Paraconsistency and word puzzles
ASP and subset minimality: enumeration, cautious reasoning and MUSes
Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures

Cited In (4)

Solving satisfiability problems with preferences
Preference-Based Problem Solving for Constraint Programming
Symbolic and Quantitative Approaches to Reasoning with Uncertainty
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)