Sciweavers

460 search results - page 5 / 92
» Revised Stable Models - A Semantics for Logic Programs
Sort
View
ASP
2005
Springer
14 years 1 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
PODS
1990
ACM
148views Database» more  PODS 1990»
13 years 11 months ago
Stable Models and Non-Determinism in Logic Programs with Negation
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
Domenico Saccà, Carlo Zaniolo
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 7 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
LPNMR
2007
Springer
14 years 1 months ago
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Ste...
IJCAI
2007
13 years 9 months ago
A New Perspective on Stable Models
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz