This work studies the satisfiability problem for FP(Ł) by presenting an algorithm and conducting an empirical evaluation over a controlled class of FP(Ł)-satisfiability instances, revealing a clear phase transition behaviour and distinctive running-time patterns.
We show that the satisfiability problem for Strategy Logic introduced by Mogavero, Murano, and Vardi is $\Pi^1_\infty$-complete, and, more strongly, computably isomorphic to true second-order arithmetic. The lower bound is established for the next-time Boolean-goal fragment of Strategy Logic. Consequently, Strategy Log...
In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have p...
This book explains how algorithms work, for example, by exploiting the structure of the SAT problem with an appropriate logical calculus, like resolution, but also algorithms based on “physical” principles are considered.
In this paper, we show that the two intuitionistic modal logics IS4 and IK4 are decidable. We provide a constructive decision procedure, that, given a formula, produces either a proof showing the formula to be valid or a finite countermodel falsifying the formula, thus also proving the finite model property for both lo...
Marianna Girlando, Roman Kuznets, Sonia Marin et al.· 1 citation
Continuing the research from four previous papers of the authors, here we check the validity of the two tautologies from the two tautologies of propositional logic
((A → B) & (A → C)) → (A → (B & C)),
((B ∨ C) → A) → ((B → A) ∨ (C → A))
and give the list of the intuitionistic fuzzy implications that satisfy these tw...
Nora A. Angelova, Janusz Kacprzyk, K. Atanassov et al.· Notes on Intuitionistic Fuzz...· 0 citations
We introduce the logic EDMon---an epistemic dynamic logic meant to model monitorability concepts in noisy runtime verification. Its syntax and semantics are defined and explained and the connection between EDMon and monitorability and noisy runtime verification concepts is explored. We then demonstrate that EDMon is su...
T. M. Ferguson, S. Logan, Shawn Standefer· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
