Sciweavers

119 search results - page 16 / 24
» Logic of infons: The propositional case
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 9 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen
IJCAI
2001
14 years 11 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
CADE
2006
Springer
15 years 10 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
AAAI
2006
14 years 11 months ago
Towards an Axiom System for Default Logic
Recently, Lakemeyer and Levesque proposed a logic of onlyknowing which precisely captures three forms of nonmonotonic reasoning: Moore's Autoepistemic Logic, Konolige's ...
Gerhard Lakemeyer, Hector J. Levesque
CIE
2007
Springer
15 years 3 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer