Results 41 to 50 of about 47,472 (286)
Propositional Update Operators Based on Formula/Literal Dependence [PDF]
ACM Transactions on Computational Logic, 2013 We present and study a general family of belief update operators in a propositional setting. Its operators are based on formula/ literal dependence, which is more fine-grained than the notion of formula/ variable dependence that was proposed in the literature: formula/variable dependence is a
Herzig, Andreas +2 more
openaire +3 more sources
On Sub-Propositional Fragments of Modal Logic [PDF]
, 2018 In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the so-called core ...
Bresolin, Davide +2 more
core +3 more sources
Short propositional refutations for dense random 3CNF formulas [PDF]
Annals of Pure and Applied Logic, 2012 Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the exponential-size resolution refutation lower bounds for random 3CNF formulas with $ (n^{1.5- }) $ clauses ...
Müller, Sebastian, Tzameret, Iddo
openaire +2 more sources
Advanced 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
Reasoning with examples: propositional formulae and database dependencies [PDF]
Acta Informatica, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khardon, Roni +2 more
openaire +2 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
SAT-based Explicit LTL Reasoning [PDF]
, 2015 We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving.
AR Bradley +25 more
core +1 more source
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
A Perspective on Interactive Theorem Provers in Physics
Advanced Science, EarlyView.Into an interactive theorem provers (ITPs), one can write mathematical definitions, theorems and proofs, and the correctness of those results is automatically checked. This perspective goes over the best usage of ITPs within physics and motivates the open‐source community run project PhysLean, the aim of which is to be a library for digitalized physics
Joseph Tooby‐Smith
wiley +1 more source
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence, 2005 A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant
openaire +3 more sources