Sciweavers

LICS
2010
IEEE
13 years 11 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ß...
JELIA
2010
Springer
13 years 11 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
CORR
2004
Springer
110views Education» more  CORR 2004»
14 years 8 days ago
On Modal Logics of Partial Recursive Functions
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
Pavel Naumov
AML
2002
112views more  AML 2002»
14 years 9 days ago
Strong normalization of a symmetric lambda calculus for second-order classical logic
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
Yoriyuki Yamagata
AI
2004
Springer
14 years 9 days ago
Qualitative choice logic
Qualitative choice logic (QCL) is a propositional logic for representing alternative, ranked options for problem solutions. The logic adds to classical propositional logic a new c...
Gerhard Brewka, Salem Benferhat, Daniel Le Berre
APAL
2005
154views more  APAL 2005»
14 years 10 days ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
AML
2006
106views more  AML 2006»
14 years 15 days ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
COMMA
2008
14 years 1 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter
AAAI
2007
14 years 2 months ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen
RELMICS
2000
Springer
14 years 4 months ago
Implication-with-possible-exceptions
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...
Nerman Jurrjus, Harrie C. M. de Swart