Search Results for author:
Found 19 papers, 1 papers with code
Elementary Sets for Logic Programs
We propose the notion of an elementary set, which is almost equivalent to the notion of an elementary loop for nondisjunctive programs, but is simpler, and, unlike elementary loops, can be extended to disjunctive programs without producing unintuitive results.
System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics
We evaluate the impact of Predictor when used as a guide for rewritings produced by the answer set programming rewriting tools Projector and Lpopt.
Proceedings 38th International Conference on Logic Programming
ICLP is the premier international event for presenting research in logic programming.
Unifying Framework for Optimizations in non-boolean Formalisms
Search-optimization problems are plentiful in scientific and engineering domains.
An Abstract View on Optimizations in Propositional Frameworks
Automated reasoning and knowledge representation are the subfields of AI that are particularly vested in these developments.
Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches
Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories.
Modular Answer Set Programming as a Formal Specification Language
In this paper, we study the problem of formal verification for Answer Set Programming (ASP), namely, obtaining a formal proof showing that the answer sets of a given (non-ground) logic program P correctly correspond to the solutions to the problem encoded by P, regardless of the problem instance.
Information Extraction Tool Text2ALM: From Narratives to Action Language System Descriptions
In this work we design a narrative understanding tool Text2ALM.
SMT-based Constraint Answer Set Solver EZSMT+
Constraint answer set programming integrates answer set programming with constraint processing.
The informal semantics of Answer Set Programming: A Tarskian perspective
In 1999, the seminal papers on answer set programming proposed to use this logic for a different purpose, namely, to model and solve search problems.
Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing different knowledge representation formalisms.
Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter
One of the main contributions of this paper is the first comprehensive account of the constraint answer set language and solver EZCSP, a mainstream representative of this research area that has been used in various successful applications.
Disjunctive Answer Set Solvers via Templates
A fundamental task in answer set programming is to compute stable models, i. e., solutions of logic programs.
Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey
This volume contains the papers presented at the sixth workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2013) held on August 25th, 2013 in Istanbul, co-located with the 29th International Conference on Logic Programming (ICLP 2013).
Abstract Modular Systems and Solvers
Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits.
