Search Results for author:
Found 23 papers, 1 papers with code
CNL2ASP: converting controlled natural language sentences into ASP
Answer Set Programming (ASP) is a popular declarative programming language for solving hard combinatorial problems.
Proceedings 39th International Conference on Logic Programming
This volume contains the Technical Communications presented at the 39th International Conference on Logic Programming (ICLP 2023), held at Imperial College London, UK from July 9 to July 15, 2023.
Proceedings 38th International Conference on Logic Programming
ICLP is the premier international event for presenting research in logic programming.
On the Configuration of More and Less Expressive Logic Programs
The decoupling between the representation of a certain problem, i. e., its knowledge model, and the reasoning side is one of main strong points of model-based Artificial Intelligence (AI).
ValAsp: a tool for data validation in Answer Set Programming
This paper formalizes the problem of data validation for ASP programs, introduces a language to specify data validation, and presents \textsc{valasp}, a tool to inject data validation in ordinary programs.
Proceedings 37th International Conference on Logic Programming (Technical Communications)
ICLP is the premier international event for presenting research in logic programming.
An ASP-based Solution to the Chemotherapy Treatment Scheduling problem
The problem of scheduling chemotherapy treatments in oncology clinics is a complex problem, given that the solution has to satisfy (as much as possible) several requirements such as the cyclic nature of chemotherapy treatment plans, maintaining a constant number of patients, and the availability of resources, e. g., treatment time, nurses, and drugs.
Operating Room (Re)Scheduling with Bed Management via ASP
The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms, taking into account different specialties, lengths and priority scores of each planned surgery, operating room session durations, and the availability of beds for the entire length of stay both in the Intensive Care Unit and in the wards.
Manipulation of Articulated Objects using Dual-arm Robots via Answer Set Programming
We validate the overall framework in the extended scenario, thereby confirming the applicability of ASP also in more realistic Robotics settings, and showing the usefulness of macro actions for the robot-based manipulation of articulated objects.
Managing caching strategies for stream reasoning with reinforcement learning
In particular, we study the applicability of reinforcement learning to continuously assess the utility of learned constraints computed in previous invocations of the solving algorithm for the current one.
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.
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs.
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.
Better Paracoherent Answer Sets with Less Resources
Answer Set Programming (ASP) is a well-established formalism for logic programming.
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.
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.
Preliminary Report on WASP 2.0
This paper reports on the recent improvements of the ASP solver WASP.
