935 search results - page 20 / 187 » Stable models and difference logic |
163
click to vote
JAIR
2007
15 years 4 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
158
click to vote
AMAI
2006
Springer
15 years 5 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
126
click to vote
CADE
2008
Springer
16 years 5 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
129
Voted
CONTEXT
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
133
click to vote
CTCS
1989
Springer
15 years 9 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...