Results 11 to 20 of about 46,994 (285)

A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]

open access: yesLogical Methods in Computer Science, 2022
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

α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic [PDF]

open access: yesInternational 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

α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2014
Based on the general form of α-resolution principle for a lattice-valued logic with truth-values defined in a lattice-valued logical algebra structure - lattice implication algebra, the further extended α-resolution method in this lattice ...
Xiaomei Zhong   +3 more
doaj   +1 more source

Design of quantum optical experiments with logic artificial intelligence [PDF]

open access: yesQuantum, 2022
Logic Artificial Intelligence (AI) is a subfield of AI where variables can take two defined arguments, True or False, and are arranged in clauses that follow the rules of formal logic.
Alba Cervera-Lierta   +2 more
doaj   +1 more source

Structural Resolution for Abstract Compilation of Object-Oriented Languages [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program, then type-checking and inference problems amount to queries to be solved ...
Luca Franceschini   +2 more
doaj   +1 more source

Determination of 3-Ary -Resolution in Lattice-valued Propositional Logic LP(X) [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2013
One of key issues for -() ary resolution automated reasoning based on lattice-valued logic with truth-value in a lattice implication algebra is to investigate the -() ary resolution of some generalized literals.
Yi Liu, Hairui Jia, Yang Xu
doaj   +1 more source

Entity Resolution in Sparse Encounter Network Using Markov Logic Network

open access: yesIEEE 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

open access: yesBulletin 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 calculus for modal logic S4

open access: yesLietuvos Matematikos Rinkinys, 2000
There is not abstract.
Stasys Norgėla
doaj   +1 more source

Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability [PDF]

open access: yesLogical 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

Home - About - Disclaimer - Privacy