2585 search results - page 344 / 517 » Automating Coherent Logic |
174
click to vote
ICLP
1998
Springer
15 years 10 months ago
1998
Springer
Interpretation Reconciled Michael Leuschel1 Department of Computer Science, K.U. Leuven, Belgium DIKU, University of Copenhagen, Denmark fy the relationship between abstract inter...
146
click to vote
LOPSTR
1998
Springer
15 years 10 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
173
click to vote
CSL
1997
Springer
15 years 10 months ago
1997
Springer
We present a complete axiomatization of test algebra ( 24, 18, 29]), the two-sorted algebraic variant of Propositional Dynamic Logic (PDL, 21, 7]). The axiomatization consists of ...
135
click to vote
ECSQARU
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...
161
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...