Sciweavers

10871 search results - page 14 / 2175
» A stable programming language
Sort
View
KR
2010
Springer
14 years 9 days ago
A Decidable Class of Groundable Formulas in the General Theory of Stable Models
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
Michael Bartholomew, Joohyung Lee
LPNMR
2007
Springer
14 years 1 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
ASP
2001
Springer
14 years 1 days ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
MP
2002
48views more  MP 2002»
13 years 7 months ago
Maximum stable set formulations and heuristics based on continuous optimization
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
Samuel Burer, Renato D. C. Monteiro, Yin Zhang
AAAI
2004
13 years 9 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao