Results 31 to 40 of about 1,803,872 (361)
Intuitionistic implication makes model checking hard [PDF]
Logical Methods in Computer Science, 2012 We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic ...
Martin Mundhenk, Felix Weiss
doaj +1 more source
On density of truth of the intuitionistic logic in one variable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj +1 more source
The Complexity of Reasoning for Fragments of Autoepistemic Logic [PDF]
ACM Transactions on Computational Logic, 2012 Autoepistemic logic extends propositional logic by the modal operator L . A formula φ that is preceded by an L is said to be “believed.” The logic was introduced by Moore in 1985 for modeling an ideally rational agent’s behavior and reasoning about his own beliefs.
Creignou, Nadia +3 more
openaire +5 more sources
Ontology-Based Data Access with a Horn Fragment of Metric Temporal Logic
AAAI Conference on Artificial Intelligence, 2017 We advocate datalogMTL, a datalog extension of a Horn fragment of the metric temporal logic MTL, as a language for ontology-based access to temporal log data.
S. Brandt +5 more
semanticscholar +1 more source
Finite Model Theory of the Triguarded Fragment and Related Logics [PDF]
Logic in Computer Science, 2021 The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality.
Emanuel Kieronski, S. Rudolph
semanticscholar +1 more source
Logic Fragments: A Coordination Model Based on Logic Inference [PDF]
, 2015 Chemical-based coordination models have proven useful to engineer self-organising and self-adaptive systems. Formal assessment of emergent global behaviours in self-organising systems is still an issue, most of the time emergent properties are being analysed through extensive simulations.
Francesco Luca De Angelis +1 more
openalex +4 more sources
Merging Fragments of Classical Logic [PDF]
, 2017 We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More precisely, we will be interested in checking whether an axiomatization for Classical Propositional Logic may be ...
Carlos Caleiro +2 more
openaire +3 more sources
Computations in fragments of intuitionistic propositional logic [PDF]
Journal of Automated Reasoning, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jongh, D. de +2 more
openaire +5 more sources
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic
International Conference on Computer Aided Verification, 2017 We consider the satisfiability problem for a fragment of separation logic including inductive predicates with shape and arithmetic properties. We show that the fragment is decidable if the arithmetic properties can be represented as semilinear sets.
Quang Loc Le +3 more
semanticscholar +1 more source
Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj +1 more source