Results 1 to 10 of about 3,597,563 (258)
A Resolution Prover for Coalition Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency.
Cláudia Nalon +3 more
doaj +9 more sources
A resolution calculus for modal logic S4
Lietuvos Matematikos Rinkinys, 2000 There is not abstract.
Stasys Norgėla
doaj +5 more sources
Operational semantics of resolution and productivity in Horn clause logic [PDF]
Formal Aspects of Computing, 2016 This paper presents a study of operational and type-theoretic properties of different resolution strategies in Horn clause logic. We distinguish four different kinds of resolution: resolution by unification (SLD-resolution), resolution by term-matching ...
Peng Fu, Ekaterina Komendantskaya
openalex +2 more sources
Entity Resolution in Sparse Encounter Network Using Markov Logic Network [PDF]
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 +2 more sources
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 +3 more sources
A logic for synchronous transitions with dynamic conflict resolution
CLEI Electronic Journal, 2000 This paper introduces a formalism named DSYNC aimed at. the design and verification of synchronous concurrent systems. The components of this formalism are a transition system and first-order linear-time temporal logic. The DSYNC transition system adopts
Vanderlei Moraes Rodrigues +1 more
doaj +3 more sources
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 +5 more sources
A Phase-Adjustable Noise-Shaping SAR ADC for Mitigating Parasitic Capacitance Effects from PIP Capacitors [PDF]
SensorsHigh parasitic capacitance from poly-insulator-poly capacitors in complementary metal oxide semiconductor (CMOS) processes presents a major bottleneck to achieving high-resolution successive approximation register (SAR) analog-to-digital converters (ADCs)
Xuelong Ouyang +4 more
doaj +2 more sources
Entity Resolution with Markov Logic [PDF]
Sixth International Conference on Data Mining (ICDM'06), 2006 Entity resolution is the problem of determining which records in a database refer to the same entities, and is a crucial and expensive step in the data mining process. Interest in it has grown rapidly in recent years, and many approaches have been proposed. However, they tend to address only isolated aspects of the problem, and are often ad hoc.
Parag Singla, Pedro Domingos
openaire +2 more sources
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 +3 more sources