2410 search results - page 27 / 482 » Multiset Ordering Constraints |
130
click to vote
ICLP
2004
Springer
15 years 9 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
144
click to vote
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
139
click to vote
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
151
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
131
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...