4513 search results - page 120 / 903 » Logic programming with satisfiability |
109
click to vote
SLOGICA
2008
15 years 3 months ago
2008
We give a brief account of some de Finetti style representation theorems for probability functions satisfying Spectrum Exchangeability in Polyadic Inductive Logic, together with ap...
174
Voted
DLT
2009
15 years 1 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
129
Voted
LPAR
1999
Springer
15 years 7 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
120
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
133
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...