Results 271 to 280 of about 46,994 (285)

Conflict resolution using logic programming

IEEE Transactions on Knowledge and Data Engineering, 2003
This paper addresses issues involved in applying the event-condition-action (ECA) rule paradigm of active databases to policies-collections of general principles specifying the desired behavior of a system. We use a declarative policy description language, PDL, in which policies are formulated as sets of ECA rules. The main contribution of the paper is
Jan Chomicki, Shamim A. Naqvi, Jorge Lobo   +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

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

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

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

A Resolution Mechanism for Prenex Gödel Logic

2010
First order Godel logic G\(^\Delta_\infty\), enriched with the projection operator Δ—in contrast to other important t-norm based fuzzy logics, like Łukasiewicz and Product logic—is well known to be recursively axiomatizable. However, unlike in classical logic, testing (1-)unsatisfiability, i.e., checking whether a formula has no interpretation that ...
Matthias Baaz, Christian G. Fermüller
openaire   +2 more sources

Uniform Interpolation by Resolution in Modal Logic

2008
The problem of computing a uniform interpolant of a given formula on a sublanguage is known in Artificial Intelligence as variable forgetting. In propositional logic, there are well known methods for performing variable forgetting. Variable forgetting is more involved in modal logics, because one must forget a variable not in one world, but in several ...
Jérôme Mengin, Andreas Herzig
openaire   +2 more sources

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