Sciweavers

460 search results - page 41 / 92
» Revised Stable Models - A Semantics for Logic Programs
Sort
View
ICLP
2007
Springer
14 years 2 months ago
Contextual Logic Programming for Ontology Representation and Querying
Abstract. The system presented in this paper aims at using Contextual Logic Programming as a computational hub for knowledge modeled by web ontologies and enable querying that repr...
Nuno Lopes 0002, Cláudio Fernandes, Salvado...
CORR
2002
Springer
169views Education» more  CORR 2002»
13 years 7 months ago
On the existence and multiplicity of extensions in dialectical argumentation
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant...
Bart Verheij
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...
SUM
2010
Springer
13 years 5 months ago
A Formal Analysis of Logic-Based Argumentation Systems
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
Leila Amgoud, Philippe Besnard
DOOD
1991
Springer
107views Database» more  DOOD 1991»
13 years 11 months ago
Non-Determinism in Deductive Databases
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
Fosca Giannotti, Dino Pedreschi, Domenico Sacc&agr...