Taming the infinite chase: Query answering under expressive relational constraints

A Calì, G Gottlob, M Kifer - Journal of Artificial Intelligence Research, 2013 - jair.org
The chase algorithm is a fundamental tool for query evaluation and for testing query
containment under tuple-generating dependencies (TGDs) and equality-generating …

[图书][B] Answer set programming: A primer

T Eiter, G Ianni, T Krennwallner - 2009 - Springer
Abstract Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted
in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing …

[HTML][HTML] Tractable query answering and rewriting under description logic constraints

H Pérez-Urbina, B Motik, I Horrocks - Journal of Applied Logic, 2010 - Elsevier
Answering queries over an incomplete database wrt a set of constraints is an important
computational task with applications in fields as diverse as information integration and …

Answer set programming

P Bonatti, F Calimeri, N Leone, F Ricca - A 25-Year Perspective on Logic …, 2010 - Springer
Abstract Answer Set Programming (ASP), referred to also as Disjunctive Logic Programming
under the stable model semantics (DLP), is a powerful formalism for Knowledge …

Computable functions in ASP: Theory and implementation

F Calimeri, S Cozza, G Ianni, N Leone - … 2008 Udine, Italy, December 9-13 …, 2008 - Springer
Abstract Disjunctive Logic Programming (DLP) under the answer set semantics, often
referred to as Answer Set Programming (ASP), is a powerful formalism for knowledge …

Rules and ontologies for the semantic web

T Eiter, G Ianni, T Krennwallner, A Polleres - Reasoning Web: 4th …, 2008 - Springer
Rules and ontologies play a key role in the layered architecture of the Semantic Web, as
they are used to ascribe meaning to, and to reason about, data on the Web. While the …

[HTML][HTML] Automata for infinite argumentation structures

P Baroni, F Cerutti, PE Dunne, M Giacomin - Artificial Intelligence, 2013 - Elsevier
The theory of abstract argumentation frameworks (af s) has, in the main, focused on finite
structures, though there are many significant contexts where argumentation can be regarded …

Conjunctive query answering in the description logic SH using knots

T Eiter, M Ortiz, M Šimkus - Journal of Computer and System Sciences, 2012 - Elsevier
Answering conjunctive queries (CQs) has been recognized as an important task for the
widening use of Description Logics (DLs) in a number of applications. The problem has …

Disjunctive ASP with functions: Decidable queries and effective computation

M Alviano, W Faber, N Leone - Theory and Practice of Logic …, 2010 - cambridge.org
Querying over disjunctive ASP with functions is a highly undecidable task in general. In this
paper we focus on disjunctive logic programs with stratified negation and functions under …

Functional answer set programming

P Cabalar - Theory and Practice of Logic Programming, 2011 - cambridge.org
In this paper we propose an extension of Answer Set Programming (ASP) to deal with
(possibly partial) evaluable functions. To this aim, we start from the most general logical …