Sciweavers

120 search results - page 8 / 24
» First Order Logic with Domain Conditions
Sort
View
CADE
2007
Springer
14 years 8 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
LOPSTR
2007
Springer
14 years 2 months ago
Termination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
Manh Thang Nguyen, Jürgen Giesl, Peter Schnei...
TABLEAUX
1998
Springer
14 years 23 days ago
Fibring Semantic Tableaux
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...
Bernhard Beckert, Dov M. Gabbay
CGF
2008
92views more  CGF 2008»
13 years 8 months ago
Pointwise radial minimization: Hermite interpolation on arbitrary domains
In this paper we propose a new kind of Hermite interpolation on arbitrary domains, matching derivative data of arbitrary order on the boundary. The basic idea stems from an interp...
Michael S. Floater, C. Schulz
CVPR
2004
IEEE
14 years 10 months ago
Propagation Networks for Recognition of Partially Ordered Sequential Action
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activi...
Yifan Shi, Yan Huang, David Minnen, Aaron F. Bobic...