Implementing preferences with asprin

DOI10.1007/978-3-319-23264-5_15zbMATH Open1467.68022OpenAlexW2212328841MaRDI QIDQ3449201FDOQ3449201

Gerhard Brewka, James 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

Recommendations

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

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

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

Cited In (5)

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

This page was built for publication: Implementing preferences with asprin

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