858 search results - page 73 / 172 » Abstract Interpretation Based Verification of Logic Programs |
100
click to vote
SAS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
ECSQARU
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
107
click to vote
ATAL
2010
Springer
15 years 29 days ago
2010
Springer
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
108
click to vote
LPNMR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
107
click to vote
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...