10715 search results - page 83 / 2143 » From Tests to Proofs |
TAMC
2010
Springer
14 years 2 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 ...
ENTCS
2006
13 years 9 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
CCS
2009
ACM
14 years 4 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
DKE
2008
13 years 9 months ago
2008
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...