Sciweavers

492 search results - page 36 / 99
» Integrating Ontology Languages and Answer Set Programming
Sort
View
ICLP
2010
Springer
13 years 7 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
ICLP
1994
Springer
14 years 22 days ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
ICLP
2003
Springer
14 years 1 months ago
Loop Formulas for Disjunctive Logic Programs
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
Joohyung Lee, Vladimir Lifschitz
JAPLL
2010
179views more  JAPLL 2010»
13 years 7 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
VLDB
2002
ACM
122views Database» more  VLDB 2002»
13 years 8 months ago
Lightweight Flexible Isolation for Language-based Extensible Systems
Safe programming languages encourage the development of dynamically extensible systems, such as extensible Web servers and mobile agent platforms. Although protection is of utmost...
Laurent Daynès, Grzegorz Czajkowski