Results 231 to 240 of about 45,065 (245)

A resolution principle for constrained logics

Artificial Intelligence, 1994
Abstract We introduce a constrained logic scheme with a resolution principle for clauses whose variables are constrained by a constraint theory. Constraints can be seen as quantifier restrictions filtering out the values that any interpretation of the underlying constraint theory can assign to the variables of a formula with such restricted ...
openaire   +2 more sources

Partitioned branch condition resolution logic

Proceedings 13th Symposium on Integrated Circuits and Systems Design (Cat. No.PR00843), 2002
This paper presents the design of an early condition resolution circuit. The proposed circuit works in parallel with the arithmetic unit, and calculates the Equal to (EQ), Greater-than (GT), Less-than (LT), Overflow (OV), Underflow (UF), and Carry-out (C/sub out/), conditions.
Aamir A. Farooqui, Vojin G. Oklobdzija, K.W. Current   +2 more
openaire   +2 more sources

First-Order Logic: Resolution

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   +2 more sources

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   +2 more sources

Logic Programming with Pseudo-Resolution

1992
This 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   +2 more sources

Resolution Strategies for the Intuitionistic Logic

1994
This paper presents a general scheme of transforming a cutfree Gentzen-type system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predicate logic. Ideas of the author and Zamov are used to avoid skolemization.
openaire   +2 more sources

Resolution and quantified epistemic logics

1986
Quantified 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   +2 more sources

Heuristics for Resolution in Propositional Logic

2009
One of the reasons for the efficiency of automated theorem systems is the usage of good heuristics. There are different semantic heuristics such as set of support which make use of additional knowledge about the problem at hand. Other widely employed heuristics work well without making any additional assumptions. A heuristic which seems to be generally
openaire   +2 more sources

The OI-Resolution of Operator Rough Logic [PDF]

, 1998
Based on rough set theory, this paper establishes operator space [ξ*, ξ*]. It is also a subset on truth value interval [0,1]. The operators is put in the front of the formulas to produce the manyvalued logic called operator rough logic(ORL). It defines OI-valid and OI-inconsistent, OI-resolution of the logic, where OI is an abbreviation of Operator ...
openaire   +1 more source

decidability by resolution for propositional modal logics

Journal of Automated Reasoning, 1999
The paper shows that satisfiability in a range of popular propositional modal systems can be decided by ordinary resolution procedures. This follows from a general result that resolution combined with condensing, and possibly some additional form of normalization, is a decision procedure for the satisfiability problem in certain so-called path logics ...
openaire   +3 more sources