A general framework for preferences in answer set programming
From MaRDI portal
Publication:6067052
DOI10.1016/j.artint.2023.104023MaRDI QIDQ6067052
Gerhard Brewka, Torsten Schaub, Javier Romero, James P. Delgrande
Publication date: 14 December 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- Solving satisfiability problems with preferences
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- Abduction from logic programs: Semantics and complexity
- Extending and implementing the stable model semantics
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programs with stable model semantics as a constraint programming paradigm
- A language-independent framework for reasoning about preferences for declarative problem solving
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- Learning conditionally lexicographic preference relations
- Complex optimization in answer set programming
- Combining approaches for solving satisfiability problems with qualitative preferences
- Optimum stable model search: algorithms and implementation
- Reasoning with Preference Trees over Combinatorial Domains
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Paraconsistency and word puzzles
- ASP for minimal entailment in a rational extension of SROEL
- ASP-Core-2 Input Language Format
- Declarative Algorithms and Complexity Results for Assumption-Based Argumentation
- Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
- A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
- 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
- ASP (): Answer Set Programming with Algebraic Constraints
- Multi-shot ASP solving with clingo
- The DLV system for knowledge representation and reasoning
- Finding similar/diverse solutions in answer set programming
- Logics in Artificial Intelligence
- Answer set programming as a modeling language for course timetabling
- Conflict-Driven Answer Set Enumeration
- Logic Programming and Nonmonotonic Reasoning
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item