Sciweavers

472 search results - page 36 / 95
» Limiting Negations in Formulas
Sort
View
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
14 years 4 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
DIAGRAMS
2004
Springer
14 years 3 months ago
Query Graphs with Cuts: Mathematical Foundations
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with...
Frithjof Dau
FOCS
1999
IEEE
14 years 2 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
ATAL
2006
Springer
14 years 2 months ago
Complexity and succinctness of public announcement logic
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
Carsten Lutz
CF
2005
ACM
14 years 8 days ago
On the energy-efficiency of speculative hardware
Microprocessor trends are moving towards wider architectures and more aggressive speculation. With the increasing transistor budgets, energy consumption has become a critical desi...
Nana B. Sam, Martin Burtscher