Sciweavers

3891 search results - page 575 / 779
» A logic for strategic reasoning
Sort
View
FLOPS
1999
Springer
14 years 2 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
ICLP
1998
Springer
14 years 2 months ago
Program Specialisation and Abstract Interpretation Reconciled
Interpretation Reconciled Michael Leuschel1 Department of Computer Science, K.U. Leuven, Belgium DIKU, University of Copenhagen, Denmark fy the relationship between abstract inter...
Michael Leuschel
LOPSTR
1998
Springer
14 years 2 months ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel
CSL
1997
Springer
14 years 2 months ago
Equational Axioms of Test Algebra
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 ...
Marco Hollenberg
ICLP
1997
Springer
14 years 2 months ago
Hybrid Probabilistic Programs
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...
Alex Dekhtyar, V. S. Subrahmanian