Results 31 to 40 of about 44,803 (280)
Encoding Lifted Classical Planning in Propositional Logic
Planning models are usually defined in lifted, i.e. first order formalisms, while most solvers need (variable-free) grounded representations. Though techniques for grounding prune unnecessary parts of the model, grounding might – nevertheless – be prohibitively expensive in terms of runtime.
Höller, Daniel, Behnke, Gregor
openaire +2 more sources
Intuitionistic fuzzy interpretation of a classical propositional logic formula [PDF]
The formula ¬A = (A → ((A → A) ∧ ¬(A → A))) is a tautology in the classical propositional logic. In this paper, we determine all intuitionistic fuzzy implications that satisfy this formula together with the classical intuitionistic fuzzy negation or with
Krassimir Atanassov +2 more
doaj +1 more source
Note on Probability of Logical Sentences and the Linda Problem
This paper presents a logical concept of probability which seems to be obvious, as it is, but the author is not aware of any elaboration of a developed studies on the issue or of any special philosophical application of it.
Adam Olszewski
doaj +1 more source
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination [PDF]
In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic and rule bases, have been proposed.
Axel Polleres +4 more
core +2 more sources
This work proposes a formulation of propositional logic, named Eigenlogic, using quantum observables as propositions. The eigenvalues of these operators are the truth-values and the associated eigenvectors the interpretations of the propositional system.
Dubois, François, Toffano, Zeno
core +3 more sources
Graphical Sequent Calculi for Modal Logics [PDF]
The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs.
Minghui Ma, Ahti-Veikko Pietarinen
doaj +1 more source
Naming Proofs in Classical Propositional Logic [PDF]
We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cut ...
François Lamarche, Lutz Straßburger
openaire +1 more source
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
We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to
Damian E. Szmuc
doaj +1 more source
Food inflation pass‐through from agricultural imports in a small open economy
Abstract This paper develops a new framework for quantifying cost pass‐through in a small open economy by estimating firm‐level markup responses to agricultural import price shocks. We show theoretically that markup adjustments depend on firms' reliance on imported inputs and demand curvature, generating heterogeneous inflationary effects across firm ...
Minseong Kang, Seungki Lee
wiley +1 more source

