Sciweavers

492 search results - page 16 / 99
» Integrating Ontology Languages and Answer Set Programming
Sort
View
LPNMR
2007
Springer
14 years 2 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 8 months ago
Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
PVLDB
2010
151views more  PVLDB 2010»
13 years 7 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
PADL
2004
Springer
14 years 1 months ago
USA-Smart: Improving the Quality of Plans in Answer Set Planning
In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The...
Marcello Balduccini
ICLP
2003
Springer
14 years 1 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