Sciweavers

174 search results - page 33 / 35
» Loop Calculus for Satisfiability
Sort
View
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
13 years 12 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
FROCOS
2000
Springer
13 years 9 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
AIML
2008
13 years 7 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 5 months ago
Provenance Traces
Provenance is information about the origin, derivation, ownership, or history of an object. It has recently been studied extensively in scientific databases and other settings due...
James Cheney, Umut A. Acar, Amal Ahmed
TON
2002
76views more  TON 2002»
13 years 5 months ago
Some properties of variable length packet shapers
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
Jean-Yves Le Boudec