Results 191 to 200 of about 3,597,563 (258)
Some of the next articles are maybe not open access.
Resolution-based methods for modal logics
Logic Journal of IGPL, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Nivelle, H., Hustadt, U., Schmidt, R.
openaire +2 more sources
In‐Sensor Tactile Fusion and Logic for Accurate Intention Recognition
Advances in MaterialsTouch control intention recognition is an important direction for the future development of human–machine interactions (HMIs). However, the implementation of parallel‐sensing functional modules generally requires a combination of different logical blocks
Zijian Huang +10 more
semanticscholar +1 more source
Extending resolution to resolution logics
Journal of Experimental & Theoretical Artificial Intelligence, 1991Abstract In previous papers (O'Hearn & Stachniak 1989b, Stachniak & O'Hearn 1990, Stachniak 1989,1990a) we proposed an algebraic methodological framework for the introduction and analysis of resolution proof systems for finitely-valued logical calculi. In the present paper we extend this approach to a wider class of the so-called resolution logics.
openaire +1 more source
1985
In this paper we describe a general way to define a resolution method in the framework of non classical logic.
openaire +2 more sources
In this paper we describe a general way to define a resolution method in the framework of non classical logic.
openaire +2 more sources
Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94), 2002
We study classes of logical calculi which have the same inconsistent sets of formulas. We investigate the algebraic structure of these classes as well as general properties of logical calculi in these classes in the context of the search for efficient resolution based automated reasoning methods. >
openaire +1 more source
We study classes of logical calculi which have the same inconsistent sets of formulas. We investigate the algebraic structure of these classes as well as general properties of logical calculi in these classes in the context of the search for efficient resolution based automated reasoning methods. >
openaire +1 more source
Propositional Logic: Resolution
2012The 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
1997
With regard to improving the efficiency of automated deduction systems, the final word has not yet been spoken. In Chapter 8 we became acquainted with various techniques for pruning search spaces associated with deduction, most of which rely on restricting applications of the resolution and factorization rules.
Rolf Socher-Ambrosius, Patricia Johann
openaire +1 more source
With regard to improving the efficiency of automated deduction systems, the final word has not yet been spoken. In Chapter 8 we became acquainted with various techniques for pruning search spaces associated with deduction, most of which rely on restricting applications of the resolution and factorization rules.
Rolf Socher-Ambrosius, Patricia Johann
openaire +1 more source
Propositional Resolution Logics
1996In 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
1990Abstract 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
2012
Resolution is a sound and complete algorithm for propositional logic: a formula in clausal form is unsatisfiable if and only if the algorithm reports that it is unsatisfiable. For propositional logic, the algorithm is also a decision procedure for unsatisfiability because it is guaranteed to terminate.
openaire +1 more source
Resolution is a sound and complete algorithm for propositional logic: a formula in clausal form is unsatisfiable if and only if the algorithm reports that it is unsatisfiable. For propositional logic, the algorithm is also a decision procedure for unsatisfiability because it is guaranteed to terminate.
openaire +1 more source