Sciweavers

10871 search results - page 11 / 2175
» A stable programming language
Sort
View
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
2002
Springer
117views Education» more  CORR 2002»
13 years 7 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
EPIA
2005
Springer
14 years 1 months ago
Revised Stable Models - A Semantics for Logic Programs
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
Luís Moniz Pereira, Alexandre Miguel Pinto
LPNMR
2001
Springer
13 years 12 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
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