551 search results - page 37 / 111 » Natural proofs |
ICALP
2011
Springer
13 years 6 days ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
IANDC
2010
13 years 7 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
CORR
2011
Springer
13 years 16 days ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
DCG
2010
13 years 8 months ago
2010
We express the matroid polytope PM of a matroid M as a signed Minkowski sum of simplices, and obtain a formula for the volume of PM . This gives a combinatorial expression for the...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...