Implementing Preferences with asprin

DOI10.1007/978-3-319-23264-5_15zbMath1467.68022OpenAlexW2212328841MaRDI QIDQ3449201

Gerhard Brewka, James P. Delgrande, Javier Romero, Torsten Schaub

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/125361

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (5)

Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Computing Diverse Optimal Stable Models ⋮ Answer Set Programming for Qualitative Spatio-temporal Reasoning: Methods and Experiments ⋮ Multi-shot ASP solving with clingo ⋮ asprin

Cites Work

• Solving satisfiability problems with preferences
• Unrestricted vs restricted cut in a tableau method for Boolean circuits
• Extending and implementing the stable model semantics
• On Optimal Solutions of Answer Set Optimization Problems
• Combining approaches for solving satisfiability problems with qualitative preferences
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning
• Planning with preferences using logic programming

This page was built for publication: Implementing Preferences with asprin