64 search results - page 8 / 13 » On the Proof Complexity of Deep Inference |
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
LFCS
2009
Springer
14 years 4 months ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
LICS
1989
IEEE
14 years 1 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
IJON
2010
13 years 8 months ago
2010
Originally devoted to specific applications such as biology, medicine and demography, duration models are now widely used in economy, finance or reliability. Recent works in var...