460 search results - page 45 / 92 » Revised Stable Models - A Semantics for Logic Programs |
104
click to vote
FSTTCS
2000
Springer
15 years 4 months ago
2000
Springer
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, D...
85
Voted
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
CTCS
1989
Springer
15 years 4 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
201
click to vote
POPL
2007
ACM
16 years 24 days ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
113
Voted
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...