Results 41 to 50 of about 164,088 (328)
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
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
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
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
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
Innovating Aircraft Repair Processes: The Role of Digitalization in Sustainability
Advanced Engineering Materials, EarlyView.This research explores how digitalization—by storing detailed non‐destructive testing data in structured DICONDE databases and creating a standard data model of the component—innovates aviation maintenance and repair processes. Coupled with a developed state‐based simulation model, it enables data‐driven, sustainable repair strategies that reduce waste,
Johanna Aigner +3 more
wiley +1 more source
The succinctness of first-order logic on linear orders [PDF]
, 2011 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Grohe, Martin, Schweikardt, Nicole
core