Results 51 to 60 of about 1,320,893 (348)
Partial cut elimination for propositional discrete linear time temporal logic
Lietuvos Matematikos Rinkinys, 2010 We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source
Cut formulas in propositional logic
Theoretical Computer Science, 1993 Cut formulas in propositional logic can speed up some proofs exponentially (a cut-free system is used as reference when we talk about speed-ups); it is hence important to study proof systems with cut, types of cut formulas (atomic cuts versus general cuts) and also relations between cut and techniques which may speed up proofs.
openaire +3 more sources
On QBF Proofs and Preprocessing [PDF]
, 2013 QBFs (quantified boolean formulas), which are a superset of propositional formulas, provide a canonical representation for PSPACE problems. To overcome the inherent complexity of QBF, significant effort has been invested in developing QBF solvers as well
A. Biere +25 more
core +1 more source
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems [PDF]
Logical Methods in Computer Science, 2013 The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound $B$, a PDL formula $\varphi$ and a CFM $\mathcal{C}$, whether every ...
Roy Mennicke
doaj +1 more source
Elliptic approximations of propositional formulae
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Infinitary Classical Logic: Recursive Equations and Interactive Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives.
Michele Basaldella
doaj +1 more source
Advanced Functional Materials, EarlyView.AI is transforming the research paradigm of battery materials and reshaping the entire landscape of battery technology. This comprehensive review summarizes the cutting‐edge applications of AI in the advancement of battery materials, underscores the critical challenges faced in harnessing the full potential of AI, and proposes strategic guidance for ...
Qingyun Hu +5 more
wiley +1 more source
Advanced Materials Interfaces, EarlyView.Zn–Sn–O thin films synthesized via ultrasonic spray pyrolysis reveal tunable phase evolution and enhanced acetone selectivity. Integrating DFT insights with machine learning predictions uncovers the role of stoichiometric control and oxygen vacancies in VOC sensing.
Kevin Rueda‐Castellanos +6 more
wiley +1 more source
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
, 2004 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Downey +3 more
core +2 more sources
Advanced 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