247 search results - page 3 / 50 » A Computational Structure for the Propositional Calculus |
TABLEAUX
2009
Springer
15 years 2 months ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
RELMICS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract: The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation ...
IJCAI
2001
14 years 11 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
TAMC
2010
Springer
15 years 3 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
In a hypothesis-based approach to digital investigation, the investigator formulates his hypothesis about which events took place, and tests them using the evidence available. A f...