Search Results for author:
Found 7 papers, 0 papers with code
Unit Testing in ASP Revisited: Language and Test-Driven Development Environment
Indeed, the first unit testing specification language for ASP was proposed in 2011 as a feature of the ASPIDE development environment.
Characterizing Nexus of Similarity within Knowledge Bases: A Logic-based Framework and its Computational Complexity Aspects
Similarities between entities occur frequently in many real-world scenarios.
Better Paracoherent Answer Sets with Less Resources
Answer Set Programming (ASP) is a well-established formalism for logic programming.
Paracoherent Answer Set Semantics meets Argumentation Frameworks
In particular, great attention has been given to the well-known stable extensions of an AF, that are closely related to the answer sets of a logic program.
Abstract Solvers for Computing Cautious Consequences of ASP programs
We show how to improve the current abstract solvers for cautious reasoning in ASP with new techniques borrowed from backbone computation in SAT, in order to design new solving algorithms.
Beyond NP: Quantifying over Answer Sets
Arguably, ASP(Q) allows one to model problems in the Polynomial Hierarchy in a direct way, providing an elegant expansion of ASP beyond the class NP.
On the Computation of Paracoherent Answer Sets
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning.
