Search Results for author:
Found 4 papers, 0 papers with code
IASCAR: Incremental Answer Set Counting by Anytime Refinement
However, navigating through parts of the solution space requires counting many times, which is expensive in theory.
Rushing and Strolling among Answer Sets -- Navigation Made Easy
For example, when a user aims to identify a specific answer set according to her needs, or requires the total number of diverging solutions to comprehend probabilistic applications such as reasoning in medical domains.
Proceedings of the First International Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning (Arg-LPNMR 2016)
This volume contains the papers presented at Arg-LPNMR 2016: First International Workshop on Argumentation in Logic Programming and Nonmonotonic Reasoning held on July 8-10, 2016 in New York City, NY.
Bound Your Models! How to Make OWL an ASP Modeling Language
To exploit the Web Ontology Language OWL as an answer set programming (ASP) language, we introduce the notion of bounded model semantics, as an intuitive and computationally advantageous alternative to its classical semantics.
