Search Results for author:
Found 26 papers, 3 papers with code
Towards Automatic Composition of ASP Programs from Natural Language Specifications
This paper moves the first step towards automating the composition of Answer Set Programming (ASP) specifications.
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.
Degradation-aware data-enabled predictive control of energy hubs
Mitigating the energy use in buildings, together with satisfaction of comfort requirements are the main objectives of efficient building control systems.
An efficient solver for ASP(Q)
In this paper, we present a new implementation that builds on the ideas of qasp and features both a more efficient encoding procedure and new optimized encodings of ASP(Q) programs in QBF.
Neuro-Symbolic AI for Compliance Checking of Electrical Control Panels
In particular, assessing the compliance of a product with the relative schematic is a time-consuming and prone-to-error process.
Reducing the impact of out of vocabulary words in the translation of natural language questions into SPARQL queries
Accessing the large volumes of information available in public knowledge bases might be complicated for those users unfamiliar with the SPARQL query language.
Proceedings 36th International Conference on Logic Programming (Technical Communications)
Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
ASP-Core-2 Input Language Format
Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual applications.
Partial Compilation of ASP Programs
In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i. e., we obtain a specific binary for a given program), and might not be subject to the grounding step.
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.
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.
Better Paracoherent Answer Sets with Less Resources
Answer Set Programming (ASP) is a well-established formalism for logic programming.
The Seventh Answer Set Programming Competition: Design and Results
Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning.
The External Interface for Extending WASP
Moreover, we review the applications of the interface witnessing it can be successfully used to extend WASP for solving effectively hard instances of both real-world and synthetic problems.
Debugging Non-Ground ASP Programs: Technique and Graphical Tools
Answer Set Programming (ASP) is one of the major declarative programming paradigms in the area of logic programming and non-monotonic reasoning.
On the Computation of Paracoherent Answer Sets
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning.
Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis
One of the successes of ASP is the availability of efficient systems.
Driving CDCL Search
The CDCL algorithm is the leading solution adopted by state-of-the-art solvers for SAT, SMT, ASP, and others.
An integrated Graphical User Interface for Debugging Answer Set Programs
Furthermore, the debugging interface is integrated in ASPIDE, a rich IDE for answer set programs.
Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems (Application Paper)
In this paper the combination of ASP and domain-specific heuristics is studied with the goal of effectively solving real-world problem instances of PUP and CCP.
Taming Primary Key Violations to Query Large Inconsistent Data
Consistent query answering over a database that violates primary key constraints is a classical hard problem in database research that has been traditionally dealt with logic programming.
Anytime Computation of Cautious Consequences in Answer Set Programming
Query answering in Answer Set Programming (ASP) is usually solved by computing (a subset of) the cautious consequences of a logic program.
The Design of the Fifth Answer Set Programming Competition
Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of logic programming and nonmonotonic reasoning.
The Multi-engine ASP Solver ME-ASP: Progress Report
MEASP is a multi-engine solver for ground ASP programs.
Preliminary Report on WASP 2.0
This paper reports on the recent improvements of the ASP solver WASP.
A Multi-Engine Approach to Answer Set Programming
Then, we apply classification methods that, given the features of the instances in a {\sl training} set and the solvers' performance on these instances, inductively learn algorithm selection strategies to be applied to a {\sl test} set.
