Sciweavers

54 search results - page 2 / 11
» MProlog: An Extension of Prolog for Modal Logic Programming
Sort
View
AMAST
2006
Springer
13 years 9 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 5 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...
ICFP
2010
ACM
13 years 6 months ago
Higher-order representation of substructural logics
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
Karl Crary
IJCAI
2007
13 years 7 months ago
ProbLog: A Probabilistic Prolog and Its Application in Link Discovery
We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belo...
Luc De Raedt, Angelika Kimmig, Hannu Toivonen
APIN
2000
155views more  APIN 2000»
13 years 5 months ago
Defeasible Logic on an Embedded Microcontroller
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
Michael A. Covington