Results 41 to 50 of about 165,831 (331)
Maximum Entropy Reasoning via Model Counting in (Description) Logics that Count
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceIn previous work it was shown that the logic ALCME, which extends the description logic (DL) ALC with probabilistic conditionals, has domain-lifted inference.
Franz Baader, Anton Claußnitzer
doaj +1 more source
Logical Methods in Computer Science, 2013 We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable.
Luc Segoufin, Balder ten Cate
doaj +1 more source
Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras [PDF]
, 2015 Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor.
Enqvist, Sebastian +2 more
core +3 more sources
Modal Logics with Hard Diamond-Free Fragments [PDF]
Journal of Logic and Computation, 2015 AbstractWe investigate the complexity of modal satisfiability for a family of multi-modal logics with interdependencies among the modalities. In particular, we examine four characteristic multi-modal logics with dependencies and demonstrate that, even if we restrict the formulae to be diamond-free and to have only one propositional variable, these ...
openaire +2 more sources
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]
Logical Methods in Computer Science, 2017 The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
doaj +1 more source
A Variant of Material Connexive Logic
Bulletin of the Section of Logic, 2021 The relationship between formal (standard) logic and informal (common-sense, everyday) reasoning has always been a hot topic. In this paper, we propose another possible way to bring it up inspired by connexive logic.
Alexander Belikov, Dmitry Zaitsev
doaj +1 more source
A Logic for True Concurrency [PDF]
, 2014 We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be identified which
Baldan, Paolo, Crafa, Silvia
core +1 more source
An Efficient Algorithm for Monitoring Practical TPTL Specifications
, 2016 We provide a dynamic programming algorithm for the monitoring of a fragment of Timed Propositional Temporal Logic (TPTL) specifications. This fragment of TPTL, which is more expressive than Metric Temporal Logic, is characterized by independent time ...
Dokhanchi, Adel +3 more
core +1 more source
Languages of Dot-depth One over Infinite Words [PDF]
, 2011 Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic.
Kufleitner, Manfred, Lauser, Alexander
core +1 more source
FEBS Letters, EarlyView.This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva +5 more
wiley +1 more source