110 search results - page 11 / 22 » A Tutorial on Proof Theoretic Foundations of Logic Programmi... |
121
click to vote
DBPL
1993
Springer
15 years 7 months ago
1993
Springer
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
157
click to vote
JAIR
2006
15 years 3 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
136
click to vote
ICLP
1999
Springer
15 years 7 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
142
click to vote
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
159
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...