Results 31 to 40 of about 653,229 (328)
Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability [PDF]
Logical Methods in Computer Science, 2012 G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each other.
Matthias Baaz +2 more
doaj +1 more source
Non-Clausal Multi-ary α-Generalized Resolution Calculus for a Finite Lattice-Valued Logic
International Journal of Computational Intelligence Systems, 2018 Due to the need of the logical foundation for uncertain information processing, development of efficient automated reasoning system based on non-classical logics is always an active research area.
Yang Xu +4 more
doaj +1 more source
A Paradox for the Existence Predicate
Bulletin of the Section of Logic, 2022 In this paper, a paradox is shown to arise in the context of classical logic from prima facie highly plausible assumptions for the existence predicate as applied to definite descriptions.
Uwe Meixner
doaj +1 more source
A resolution-based calculus for Coalition Logic [PDF]
Journal of Logic and Computation, 2014 We present a resolution-based calculus for Coalition Logic CL, a non-normal modal logic used for reasoning about cooperative agency. We introduce a normal form and a set of inference rules to solve the satisfiability problem in CL. We also show that the calculus presented here is sound, complete, and terminating.
Cláudia Nalon +3 more
openaire +2 more sources
Resolution principles in possibilistic logic
International Journal of Approximate Reasoning, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dubois, Didier, Prade, Henri
openaire +2 more sources
An alternative proof method for possibilistic logic and its application to terminological logics [PDF]
, 1993 Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree or a necessity
Baader +8 more
core +2 more sources
A Novel Combinational ATP Based on Contradiction Separation for First-Order Logic
International Journal of Computational Intelligence Systems, 2020 At present, most of the first-order logic theorem provers use a binary-resolution method, which can effectively solve the general first-order logic problems to a certain extent.
Jian Zhong, Yang Xu, Feng Cao
doaj +1 more source
Informatika, 2021 There are three main families of inference algorithms in first-order logic: direct inference and its application to deductive databases and production systems; backward inference procedures and logic programming systems; theorem proving systems based on ...
A. М. Sobol +2 more
doaj +1 more source
Resolution for temporal logics of knowledge
Journal of Logic and Computation, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Clare Dixon +2 more
openaire +3 more sources
Resolution method for some class of formulas of modal logic S4
Lietuvos Matematikos Rinkinys, 2004 There is not abstract.
Stanislovas Norgėla
doaj +3 more sources