Results 1  10
of
778
Propositional Satisfiability in AnswerSet Programming
 In Proceedings of Joint German/Austrian Conference on Artificial Intelligence, KI'2001
, 2001
"... We show that propositional logic and its extensions can support answerset programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logic of propositional schemata and on a version of the Closed World Assumption. We ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
We show that propositional logic and its extensions can support answerset programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logic of propositional schemata and on a version of the Closed World Assumption
Abstract Solvers for Dung’s Argumentation Frameworks
"... Abstract solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way and have proven successful in declarative paradigms such as Propositional Satisfiability and AnswerSet Programming. In this paper, we apply this machinery for the first time to a dedicated AI formal ..."
Abstract
 Add to MetaCart
Abstract solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way and have proven successful in declarative paradigms such as Propositional Satisfiability and AnswerSet Programming. In this paper, we apply this machinery for the first time to a dedicated AI
Backdoors to Tractable AnswerSet Programming
 PROCEEDINGS OF THE TWENTYSECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... We present a unifying approach to the efficient evaluation of propositional answerset programs. Our approach is based on backdoors which are small sets of atoms that represent “clever reasoning shortcuts” through the search space. The concept of backdoors is widely used in the areas of propositiona ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We present a unifying approach to the efficient evaluation of propositional answerset programs. Our approach is based on backdoors which are small sets of atoms that represent “clever reasoning shortcuts” through the search space. The concept of backdoors is widely used in the areas
Answer set programming based on propositional satisfiability
 Journal of Automated Reasoning, 36:345–377, Gelfond
"... Abstract. Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic pro ..."
Abstract

Cited by 63 (9 self)
 Add to MetaCart
Abstract. Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic
DATALOG with constraints  an answerset programming system
 Proceedings of the 17th National Conference on Arti Intelligence
, 2000
"... Answerset programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional logic is, arguably, the simplest ASP system with an intuitive semantics supporting direct modeling of problem constraints ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Answerset programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional logic is, arguably, the simplest ASP system with an intuitive semantics supporting direct modeling of problem
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
Aspps  an Implementation of AnswerSet Programming with Propositional Schemata
, 2001
"... We present an implementation of an answerset programming paradigm, called aspps (short for answerset programming with propositional schemata). The system aspps is designed to process PS theories. It consists of two basic modules. The first module, psgrnd, grounds an PS theory. The second ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We present an implementation of an answerset programming paradigm, called aspps (short for answerset programming with propositional schemata). The system aspps is designed to process PS theories. It consists of two basic modules. The first module, psgrnd, grounds an PS theory
AnswerSet Programming with Bounded Treewidth
, 2009
"... In this paper, we present a novel approach to the evaluation of propositional answerset programs. In particular, for programs with bounded treewidth, our algorithm is capable of (i) computing the number of answer sets in linear time and (ii) enumerating all answer sets with linear delay. Our algori ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
In this paper, we present a novel approach to the evaluation of propositional answerset programs. In particular, for programs with bounded treewidth, our algorithm is capable of (i) computing the number of answer sets in linear time and (ii) enumerating all answer sets with linear delay. Our
Testing Relativised Uniform Equivalence under AnswerSet Projection in the System cc ⊤ ⋆
"... Abstract. The systemcc ⊤ is a tool for testing correspondence between propositional logic programs under the answerset semantics with respect to different refined notions of program correspondence. The underlying methodology of cc ⊤ is to reduce a given correspondence problem to the satisfiability ..."
Abstract
 Add to MetaCart
Abstract. The systemcc ⊤ is a tool for testing correspondence between propositional logic programs under the answerset semantics with respect to different refined notions of program correspondence. The underlying methodology of cc ⊤ is to reduce a given correspondence problem to the satisfiability
On semantic update operators for answerset programs
 In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI
, 2010
"... Abstract. Logic programs under the stable models semantics, or answerset programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wellunderstood semantics. However, handling the evolution of rule bases is still a largely open problem. The AGM ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
Abstract. Logic programs under the stable models semantics, or answerset programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wellunderstood semantics. However, handling the evolution of rule bases is still a largely open problem. The AGM
Results 1  10
of
778