Sciweavers

Share
ICLP
2003
Springer
9 years 12 months ago
Computing Minimal Models, Stable Models, and Answer Sets
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
Zbigniew Lonc, Miroslaw Truszczynski
ASP
2003
Springer
10 years 8 hour ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
VLDB
2004
ACM
96views Database» more  VLDB 2004»
10 years 3 days ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
NMR
2004
Springer
10 years 4 days ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
ICLP
2004
Springer
10 years 4 days ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
LPNMR
2005
Springer
10 years 8 days ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub
ASP
2005
Springer
10 years 9 days ago
Combining Answer Sets of Nonmonotonic Logic Programs
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
Chiaki Sakama, Katsumi Inoue
ASP
2005
Springer
10 years 9 days ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
ASP
2005
Springer
10 years 9 days ago
An Interactive Approach to Answer Set Programming
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our a...
Martin Brain, Richard Watson, Marina De Vos
ASP
2005
Springer
10 years 9 days ago
A Language for Modular Answer Set Programming: Application to ACC Tournament Scheduling
In this paper we develop a declarative language for modular answer set programming (ASP). Our language allows to declaratively state how one ASP module can import processed answer ...
Luis Tari, Chitta Baral, Saadat Anwar
books