Sciweavers

460 search results - page 34 / 92
» Revised Stable Models - A Semantics for Logic Programs
Sort
View
TCS
2011
13 years 2 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 7 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka
CASCON
2004
108views Education» more  CASCON 2004»
13 years 9 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
IWFM
1998
13 years 9 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
LPNMR
2007
Springer
14 years 2 months ago
An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible Logic ...
Edgardo Ferretti, Marcelo Errecalde, Alejandro Jav...