Search Results for author:
Found 15 papers, 3 papers with code
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.
A Formal Comparison between Datalog-based Languages for Stream Reasoning (extended version)
The paper investigates the relative expressiveness of two logic-based languages for reasoning over streams, namely LARS Programs -- the language of the Logic-based framework for Analytic Reasoning over Streams called LARS -- and LDSR -- the language of the recent extension of the I-DLV system for stream reasoning called I-DLV-sr.
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.
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.
A logic-based decision support system for the diagnosis of headache disorders according to the ICHD-3 international classification
Decision support systems play an important role in medical fields as they can augment clinicians to deal more efficiently and effectively with complex decision-making processes.
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.
Precomputing Datalog evaluation plans in large-scale scenarios
With the more and more growing demand for semantic Web services over large databases, an efficient evaluation of Datalog queries is arousing a renewed interest among researchers and industry experts.
Enhancing magic sets with an application to ontological reasoning
It turns out that the new version of magic sets is closed for Datalog programs with stratified negation and aggregations, which is very convenient to obtain efficient computation of the stable model of the rewritten program.
On the Computation of Paracoherent Answer Sets
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning.
Driving CDCL Search
The CDCL algorithm is the leading solution adopted by state-of-the-art solvers for SAT, SMT, ASP, and others.
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.
Ontology-driven Information Extraction
Homogeneous unstructured data (HUD) are collections of unstructured documents that share common properties, such as similar layout, common file format, or common domain of values.
Complexity and Compilation of GZ-Aggregates in Answer Set Programming
Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates.
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
As a consequence, a well-founded semantics for general LPA programs that allows for tractable computation is unlikely to exist, which justifies the restriction on LPAma programs.
The DLV System for Knowledge Representation and Reasoning
As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems.
