50 search results - page 3 / 10 » Rewrite-Based Satisfiability Procedures for Recursive Data S... |
ACL
1993
13 years 7 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
CVPR
2000
IEEE
13 years 10 months ago
2000
IEEE
This paper describes a fast and robust approach to recovering structure and motion from video frames. It rst describes a robust recursive factorization method for ane projection...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
JMLR
2006
13 years 5 months ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...