Sciweavers

3773 search results - page 562 / 755
» Logical Reasoning
Sort
View
171
Voted
FLOPS
1999
Springer
15 years 9 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
141
Voted
ICLP
1998
Springer
15 years 9 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
150
Voted
CSL
1997
Springer
15 years 9 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
131
Voted
ICLP
1997
Springer
15 years 9 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
141
Voted
LICS
1994
IEEE
15 years 9 months ago
A Fully Abstract Semantics for Concurrent Graph Reduction
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Alan Jeffrey