Sciweavers

4617 search results - page 476 / 924
» Automation of Diagrammatic Reasoning
Sort
View
LICS
2010
IEEE
15 years 5 months ago
Breaking Paths in Atomic Flows for Classical Logic
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
Alessio Guglielmi, Tom Gundersen, Lutz Straß...
LICS
2010
IEEE
15 years 5 months ago
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
Martin Otto
LPAR
2010
Springer
15 years 5 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
LPAR
2010
Springer
15 years 5 months ago
Clause Elimination Procedures for CNF Formulas
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Marijn Heule, Matti Järvisalo, Armin Biere
LPAR
2010
Springer
15 years 5 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen