Sciweavers

426 search results - page 8 / 86
» Possibilistic Stable Model Computing
Sort
View
CORR
1998
Springer
126views Education» more  CORR 1998»
13 years 7 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
IRI
2003
IEEE
14 years 28 days ago
AnyLog stable design pattern
— The AnyLog pattern models the core knowledge of any Log, as a written record. The Log finds extensive use in the computing industry. The pattern makes it easy to model differen...
Mohamed E. Fayad, Jayashree Rajagopalan, Anita Ran...
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
14 years 4 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...
JLP
2000
134views more  JLP 2000»
13 years 7 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
ICLP
2003
Springer
14 years 26 days ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink