Results 31 to 40 of about 27,177 (320)
Proof Complexity of Propositional Default Logic [PDF]
, 2010 Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic.
Beyersdorff, O +4 more
core +3 more sources
Alternative modeling schemes for propositional calculus problem
KKU Engineering Journal, 2016 The main objective of this paper is to discuss alternative approaches to convert a propositional logic problem into a 0-1 integer program. The substitution method proposed by Williams and CNF method is used for modeling and representation of logical ...
Anupama Chanda +2 more
doaj +1 more source
More efficient proof-search for sequents of temporal logic
Lietuvos Matematikos Rinkinys, 2022 The present paper deals with efficiency improvement of backward proof-search of sequents of propositional linear temporal logic, using a loop-type sequent calculus.
Romas Alonderis
doaj +1 more source
Classical Logic in the Quantum Context
Quantum Reports, 2020 It is generally accepted that quantum mechanics entails a revision of the classical propositional calculus as a consequence of its physical content. However, the universal claim according to which a new quantum logic is indispensable in order to model ...
Andrea Oldofredi
doaj +1 more source
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi [PDF]
Logical Methods in Computer Science, 2017 In this paper we give an arithmetical proof of the strong normalization of lambda-Sym-Prop of Berardi and Barbanera [1], which can be considered as a formulae-as-types translation of classical propositional logic in natural deduction style.
Peter Battyanyi, Karim Nour
doaj +1 more source
, 2016 Quantified Boolean formulas (QBFs) generalize propositional formulas by admitting quantifications over propositional variables. QBFs can be viewed as (restricted) formulas of first-order predicate logic and easy translations of QBFs into first-order ...
Egly, Uwe
core +2 more sources
The Complexity of Enriched Mu-Calculi [PDF]
Logical Methods in Computer Science, 2008 The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known to be decidable
Piero A. Bonatti +3 more
doaj +1 more source
Towards Uniform Certification in QBF [PDF]
Logical Methods in Computer ScienceWe pioneer a new technique that allows us to prove a multitude of previously open simulations in QBF proof complexity. In particular, we show that extended QBF Frege p-simulates clausal proof systems such as IR-Calculus, IRM-Calculus, Long-Distance Q ...
Leroy Chew, Friedrich Slivovsky
doaj +1 more source
Arthritis Care &Research, Accepted Article.Objective The objective was to identify factors determining acute arthritis resolution and safety with colchicine and prednisone in acute calcium pyrophosphate (CPP) crystal arthritis. Methods We conducted a post hoc analysis of the COLCHICORT trial, which compared colchicine and prednisone for the treatment of acute CPP crystal arthritis, using a ...
Tristan Pascart +14 more
wiley +1 more source
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae [PDF]
Logical Methods in Computer Science, 2016 Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent calculus and a ...
Paola Bruscoli +3 more
doaj +1 more source