A remark on propositional calculus with variable functors [PDF]
Arai, Yoshinari, Tanaka, Shôtarô
openaire +3 more sources
Proposition d'une solution approchée pour l'étude du maximum de plusieurs variables aléatoires [PDF]
Jean‐Pierre Melin
openaire +2 more sources
Algebraic formulations of propositional calculi with variable forming functors [PDF]
Kiyoshi Iséki
openaire +3 more sources
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
Propositional frame-based modeling is one of the most effective methods of cognitive linguistics. This method considers the interaction between the semantic and cognitive aspects of units of two typologically different languages, e.g. Russian and Chinese,
Guo Li Hong, F. E. Abdullayeva
doaj +1 more source
Towards a Notion of Basis for Knowledge-Based Systems—Applications
In the paradigm of Knowledge-Based Systems (KBS), the design of methods to simplify the reasoning leads to more efficient processes. A point of view that provides valuable insights is the algebraic one. In this work, a notion of basis (and dimension) for
Gonzalo A. Aranda-Corral +3 more
doaj +1 more source
Intuitionistic implication makes model checking hard [PDF]
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic ...
Martin Mundhenk, Felix Weiss
doaj +1 more source
A Deletion Algorithm for the Marginal Problem in Propositional Logic Based on Boolean Arrays
This paper proposes a deletion algorithm for the marginal problem in propositional logic. The algorithm is based on the general Davis and Putnam deletion algorithm DP, expressed as a bucket elimination algorithm, representing sets of clauses with the ...
Efraín Díaz-Macías, Serafín Moral
doaj +1 more source
Investigating the use of inference-making strategy in reading comprehension: Evidence from strong and weak Persian students in terms of reading comprehension [PDF]
INTRODUCTIONThe ultimate goal of language processing while reading is the comprehension of written text, which requires the simultaneous interaction of cognitive and metacognitive strategies. Inference-making is a cognitive strategy that could be defined
Sarana Ghavami, Maryam Danaye Tous
doaj +1 more source
On density of truth of the intuitionistic logic in one variable [PDF]
In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj +1 more source

