Results 11 to 20 of about 45,065 (245)
Lietuvos Matematikos Rinkinys, 2011 We describe a resolution method and a procedure to transform formulae of some pure hybrid logics into their clausal form.
Stanislovas Norgėla
doaj +4 more sources
Entity Resolution in Sparse Encounter Network Using Markov Logic Network
IEEE Access, 2021 Entity Resolution, which identifies different descriptions referring to the same real-world entity, is a fundamental stage in data integration process essential for quality data analysis.
Christian Lu, Guangyan Huang, Yong Xiang
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
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
A resolution calculus for modal logic S4
Lietuvos Matematikos Rinkinys, 2000 There is not abstract.
Stasys Norgėla
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
The Completeness of Propositional Resolution: A Simple and Constructive Proof [PDF]
Logical Methods in Computer Science, 2006 It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a resolution ...
Jean Gallier
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
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
Time-to-Digital Converter IP-Core for FPGA at State of the Art
IEEE Access, 2021 The Field Programmable Gate Array (FPGA) structure poses several constraints that make the implementation of complex asynchronous circuits such as Time–Mode (TM) circuits almost unfeasible.
Fabio Garzetti +3 more
doaj +1 more source