Results 61 to 70 of about 1,803,872 (361)
Fragments of Some Subintuitionistic Logics [PDF]
In this article we determine the implicational fragments of most of the known subintuitionistic logics.
Fatemeh Maleki, Dick de Jongh
openalex +3 more sources
On Sub-Propositional Fragments of Modal Logic
Logical Methods in Computer Science, 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 fragment, defined as the intersection of the Horn and the Krom fragments, plus their sub-fragments obtained
Bresolin, Davide +2 more
openaire +6 more sources
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
A structurally complete fragment of relevant logic. [PDF]
Notre Dame Journal of Formal Logic, 1992 In the fragment of relevant logic \(R\) whose connectives are \(\to\) and \(\&\), every admissible rule is derivable. The proof is a non-trivial variant of the argument in the intuitionist case.
Slaney, John K., Meyer, Robert K.
openaire +2 more sources
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
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
Reachability Logic: An Efficient Fragment of Transitive Closure Logic
Logic Journal of IGPL, 2000 Reachability logic (\({\mathcal RL}\)) is defined. It is a fragment of \(\text{FO}^2(\text{TC})\) (with Boolean variables), i.e. a fragment of the restriction of first-order logic with transitive closure in which only two variables may appear in a formula. It is shown that PDL and \(\text{CTL}^\star\) can be embedded in reachability logic.
N. Alechina, N. Immerman
semanticscholar +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