Results 31 to 40 of about 27,151 (281)

Alternative modeling schemes for propositional calculus problem

open access: yesKKU 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

Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi [PDF]

open access: yesLogical 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

Canonical Proof nets for Classical Logic [PDF]

open access: yes, 2012
Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof.
McKinley, Richard
core   +2 more sources

The Complexity of Enriched Mu-Calculi [PDF]

open access: yesLogical 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]

open access: yesLogical Methods in Computer Science
We 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

Roadmap to Precision 3D Printing of Cellulose: Rheology‐Guided Formulation, Fidelity Assessment, and Application Horizons

open access: yesAdvanced Materials Technologies, EarlyView.
This critical review presents a comprehensive roadmap for the precision 3D printing of cellulose. Quantitative correlations link ink formulation and rheological properties to print fidelity and final material performance. This framework guides the development of advanced functional materials, from biomedical scaffolds to electromagnetic shielding ...
Majed Amini   +3 more
wiley   +1 more source

Undecidable Iterative Propositional Calculus [PDF]

open access: yesAlgebra and Logic, 2016
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We construct an undecidable iterative propositional calculus using axioms in 3 variables.
openaire   +2 more sources

Generic Modal Cut Elimination Applied to Conditional Logics [PDF]

open access: yes, 2011
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
A. Ciabattoni and K. Terui   +11 more
core   +1 more source

Factors Driving Battery and Solar Purchase Decision of Residents: a Behavioural Choice Experiment Using a Hybrid Discrete Choice and Latent Variable Model

open access: yesAdvanced Sustainable Systems, EarlyView.
This article explores what drives households to adopt solar PV and battery systems in South East Queensland. Using hybrid discrete choice experiments, it reveals distinct adopter profiles and highlights cost, system size, and energy independence as key motivators.
Mohammad Alipour   +3 more
wiley   +1 more source

Sequent systems for PLTL

open access: yesLietuvos Matematikos Rinkinys, 2013
We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”.  The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy