Results 211 to 220 of about 3,597,563 (258)
Some of the next articles are maybe not open access.
Extending resolution to predicate logic
1990Abstract In order to deal with clauses of predicate logic, the propositional resolution inference rule described in Theme 26 must be supplemented by the implicit use of a further sound inference rule known as universal instantiation: Here is a simple example, in which the clauses’ assumed outermost universal ...
openaire +1 more source
Formalization of the Resolution Calculus for First-Order Logic
Journal of automated reasoning, 2018Anders Schlichtkrull
semanticscholar +1 more source
The Recursive Resolution method for Modal Logic
New Generation Computing, 1987The author suggests a syntactic proof procedure for the modal logic system S4 avoiding explicit construction of possible worlds or reduction of modalities by quantified variables. The basic approach mirrors that of Robinson's resolution for predicate calculus.
openaire +2 more sources
Resolution and quantified epistemic logics
1986Quantified modal logics have emerged as useful tools in computer science for reasoning about knowledge and belief of agents and systems. An important class of these logics have a possible-world semantics from Kripke. Surprisingly, there has been relatively little work on proof theoretic methods that could be used in automatic deduction systems ...
openaire +1 more source
Conflict resolution, logic of identity and recognition through narrative
, 2016P. Singsuriya
semanticscholar +1 more source
Formalization of the Resolution Calculus for First-Order Logic
International Conference on Interactive Theorem Proving, 2016Anders Schlichtkrull
semanticscholar +1 more source
Active Learning Based Entity Resolution Using Markov Logic
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2016Jeffrey Fisher, P. Christen, Qing Wang
semanticscholar +1 more source
Logic Programming with Pseudo-Resolution
1992This paper presents a new proof technique for Automated Reasoning and Logic Programming which based on a generalization of the original Connection Graph paradigm of Kowalski and provides a methodology for Logic Programming in this framework.
openaire +1 more source
A Resolution-Based Calculus For Temporal Logics
1995Das ständig wachsende Interesse an Temporallogiken in zahlreichen Gebieten der Informatik verlangt nach Methoden, mit deren Hilfe effizient und schnell Schlussfolgerungen in diesen Logiken gezogen werden können. Üblicherweise geschieht dies durch die Entwicklung eines implementierten Kalküls, und tatsächlich wurden in den vergangenen Jahren ...
openaire +2 more sources

