Results 131 to 140 of about 58,088 (162)

Propositional Logic: Resolution

2012
The method of resolution, invented by J.A. Robinson in 1965, is an efficient method for searching for a proof. In this section, we introduce resolution for the propositional logic, though its advantages will not become apparent until it is extended to first-order logic.
openaire   +1 more source

Resolution for logic programming with universal quantifiers

1997
It is clearly desirable that logical specifications and the programs that implement them should be as close as possible. Such a claim is often made in support of the logic programming paradigm. However, SLD-resolution, the basic procedural semantics for logic programming, is only defined for programs whose statements are Horn clauses. Most research for
Bowers, AF, Hill, PM, Iba, F
openaire   +1 more source

A Resolution-Based Calculus for Preferential Logics

2018
The vast majority of modal theorem provers implement modal tableau, or backwards proof search in (cut-free) sequent calculi. The design of suitable calculi is highly non-trivial, and employs nested sequents, labelled sequents and/or specifically designated transitional formulae. Theorem provers for first-order logic, on the other hand, are by and large
Cláudia Nalon, Dirk Pattinson
openaire   +1 more source

Resolution for propositional logic

1990
Abstract Resolution comprises a single inference rule applicable to clausal-form logic. Briefly, from any two clauses having an appropriate form, resolution derives a new clause as their consequence. It is best explained by first showing how it works in the special case of propositional clausal form.
openaire   +1 more source

The Recursive Resolution method for Modal Logic

New Generation Computing, 1987
The 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

Propositional Resolution Logics

1996
In this chapter, we provide a characterization of the class of propositional resolution logics and delineate the distinct character of resolution logics with strong resolution counterparts. We also study resolution counterparts of disjunctive logics and show that in the presence of disjunction, the deductive process can be based on a single-conclusion ...
openaire   +1 more source

Resolution in logic programming

1990
Abstract We shall now start bringing together various ideas from the preceding Themes in order to explain how resolution is typically adapted for the purpose of logic programming.
openaire   +1 more source

Search strategies for resolution in temporal logics

1996
In this paper we give and evaluate the algorithms for a fully automated temporal resolution theorem prover. An approach to applying resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher.
openaire   +3 more sources

Resolution-based reasoning for fuzzy logic

1990
A commonplace in the expert system literature has been that the resolution principle is inapplicable as an inference rule for expert systems. This claim has been due to the fact that many expert system applications inevitably have to reason about uncertain knowledge, and that the resolution principle cannot handle that kind of information.
openaire   +1 more source

An input signal dependent 8-to-12 bit variable resolution SAR ADC with digitally implemented bit enhancement Logic

AEU - International Journal of Electronics and Communications, 2023
Naveen Kandpal, Anil Singh
exaly