A resolution method for a non monotonic multimodal logic

2005 ◽  
pp. 257-264 ◽  
Author(s):  
Christophe Mathieu
Keyword(s):  
Resolution Method ◽  
Multimodal Logic

Resolution systems and their applications I

1980 ◽  
Vol 3 (2) ◽  
pp. 235-268
Author(s):  
Ewa Orłowska
Keyword(s):  
Theorem Proving ◽  
Sufficient Conditions ◽  
Predicate Calculus ◽  
Resolution Method ◽  
First Order ◽  
Deductive Systems ◽  
Resolution System ◽  
Resolution Principle ◽  
Necessary And Sufficient ◽  
Classical Predicate

The central method employed today for theorem-proving is the resolution method introduced by J. A. Robinson in 1965 for the classical predicate calculus. Since then many improvements of the resolution method have been made. On the other hand, treatment of automated theorem-proving techniques for non-classical logics has been started, in connection with applications of these logics in computer science. In this paper a generalization of a notion of the resolution principle is introduced and discussed. A certain class of first order logics is considered and deductive systems of these logics with a resolution principle as an inference rule are investigated. The necessary and sufficient conditions for the so-called resolution completeness of such systems are given. A generalized Herbrand property for a logic is defined and its connections with the resolution-completeness are presented. A class of binary resolution systems is investigated and a kind of a normal form for derivations in such systems is given. On the ground of the methods developed the resolution system for the classical predicate calculus is described and the resolution systems for some non-classical logics are outlined. A method of program synthesis based on the resolution system for the classical predicate calculus is presented. A notion of a resolution-interpretability of a logic L in another logic L ′ is introduced. The method of resolution-interpretability consists in establishing a relation between formulas of the logic L and some sets of formulas of the logic L ′ with the intention of using the resolution system for L ′ to prove theorems of L. It is shown how the method of resolution-interpretability can be used to prove decidability of sets of unsatisfiable formulas of a given logic.

On-the-fly ambiguity resolution method for pseudolite/INS integration based on double-difference square observations

GPS Solutions ◽  
2021 ◽  
Vol 25 (4) ◽  
Author(s):  
Shijie Yun ◽  
Zheng Yao ◽  
Mingquan Lu
Keyword(s):  
Ambiguity Resolution ◽  
Double Difference ◽  
Resolution Method

A new amine resolution method and its application to 3-aminobenzodiazepines

1987 ◽  
Vol 28 (5) ◽  
pp. 521-522 ◽  
Author(s):  
Kenneth E Rittle ◽  
Ben E Evans ◽  
Mark G Bock ◽  
Robert M DiPardo ◽  
Willie L Whitter ◽  
...  
Keyword(s):  
Resolution Method

Study of advanced mask inspection optics with super-resolution method for next-generation mask fabrication

2009 ◽  
Author(s):  
Ryoichi Hirano ◽  
Masatoshi Hirono ◽  
Riki Ogawa ◽  
Nobutaka Kikuiri ◽  
Kenichi Takahara ◽  
...  
Keyword(s):  
Super Resolution ◽  
Next Generation ◽  
Resolution Method ◽  
Mask Inspection ◽  
Mask Fabrication

scholarly journals α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic

2013 ◽  
Vol 7 (3) ◽  
pp. 418-431 ◽  
Author(s):  
Xiaomei Zhong ◽  
Yang Xu ◽  
Jun Liu ◽  
Shuwei Chen
Keyword(s):  
Resolution Method ◽  
Semantic Resolution

Phase Resolution Method of PA Spectra in Copper(II)-EDTA Complexes

1993 ◽  
Vol 28 (5) ◽  
pp. 677-682 ◽  
Author(s):  
Zhang Yugeng ◽  
Zhao Guiwen
Keyword(s):  
Resolution Method ◽  
Edta Complexes ◽  
Phase Resolution
Sign in / Sign up

Export Citation Format

Share Document