Results 41 to 50 of about 1,821,618 (323)
Covering and separation for logical fragments with modular predicates [PDF]
Logical Methods in Computer Science, 2019 For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first language, while being ...
Thomas Place +2 more
doaj +1 more source
Querying Log Data with Metric Temporal Logic [PDF]
Journal of Artificial Intelligence Research, 2017 We propose a novel framework for ontology-based access to temporal log data using a datalog extension datalogMTL of the Horn fragment of the metric temporal logic MTL.
S. Brandt +4 more
semanticscholar +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
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
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
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
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
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
Molecular Oncology, EarlyView.This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source