Results 41 to 50 of about 1,151,417 (307)
Axiomatizations of Team Logics
, 2018 In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the dependence-free fragment FO(~
Lück, Martin
core +1 more source
Complexity Results for Modal Dependence Logic [PDF]
, 2010 Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is determined by those of ...
F.M. Donini +8 more
core +3 more sources
Neutrosophic Modal Logic [PDF]
Neutrosophic Sets and Systems, 2017 We introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic and of neutrosophic propositional logic.
Florentin Smarandache
doaj +1 more source
On Equivalence of Infinitary Formulas under the Stable Model Semantics [PDF]
, 2014 Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions
Harrison, Amelia +2 more
core +1 more source
The Local Definability of Robotic Large-Scale Knowledge Based on Splitting
International Journal of Advanced Robotic Systems, 2016 In order to reduce the computational tasks in robots with large-scale and complex knowledge, several methods of robotic knowledge localization have been proposed over the past decades.
Maonian Wu, Yunliang Jiang, Shaojun Zhu
doaj +1 more source
α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic [PDF]
International Journal of Computational Intelligence Systems, 2012 This paper focuses on effcient non-clausal resolution-based automated reasoning methods and algorithms for a lattice-ordered linguistic truth-valued logic, which corresponds to extensions of α-lock resolution.
Xingxing He +3 more
doaj +1 more source
Agribusiness, EarlyView.ABSTRACT Innovation is essential for competitiveness in agribusiness facing dynamic environments. This study examines how market orientation, marketing, relational, and social capabilities influence innovation performance. Using data from 751 Spanish firms and a multi‐method approach that integrates Structural Equation Modeling (PLS‐SEM), Necessary ...
Beatriz Corchuelo Martínez‐Azúa +1 more
wiley +1 more source
A Proof-Theoretic Interpolation Theorem for Inquisitive Propositional Logic
Bulletin of the Section of LogicThis paper presents a sequent calculus for Inquisitive Propositional Logic obtained by expanding the sequent calculus g3ip for intuitionistic propositional logic with suitable rules for double negation elimination for atoms and the Split Property.
Andreas Fjellstad
doaj +1 more source
Brodsky’s coding method for propositional logic
Lietuvos Matematikos Rinkinys, 2017 Brodsky’s coding method for propositional logic is considered in the paper. Based on the sequent calculus, the method allows us to determine whether an arbitrary sequent is derivable in the calculus without constructing proof-search trees.
Romas Alonderis
doaj +1 more source
Smart Sensorization Using Propositional Dynamic Logic
Sensors, 2022 The current high energy prices pose a serious challenge, especially in the domestic economy. In this respect, one of the main problems is obtaining domestic hot water.
Salvador Merino +3 more
doaj +1 more source