Sciweavers

140 search results - page 8 / 28
» Stable Models and Non-Determinism in Logic Programs with Neg...
Sort
View
ASP
2003
Springer
15 years 4 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
ICLP
1992
Springer
15 years 3 months ago
The Stable Models of a Predicate Logic Program
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
LPNMR
2007
Springer
15 years 5 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...
AMAI
2008
Springer
14 years 11 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
76
Voted
ICLP
2010
Springer
15 years 3 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto