Results 291 to 300 of about 653,229 (328)
Some of the next articles are maybe not open access.
Resolution and quantified epistemic logics
1986Quantified 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 +1 more source
Resolution Strategies for the Intuitionistic Logic
1994This 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 +1 more source
Conflict resolution using logic programming
IEEE Transactions on Knowledge and Data Engineering, 2003This 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 +2 more
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 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
Heuristics for Resolution in Propositional Logic
2009One 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 +1 more source
A Resolution-Based Calculus for Preferential Logics
2018The 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
A Resolution Mechanism for Prenex Gödel Logic
2010First 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 +1 more source
A Resolution-Based Calculus For Temporal Logics
1995Das ständig wachsende Interesse an Temporallogiken in zahlreichen Gebieten der Informatik verlangt nach Methoden, mit deren Hilfe effizient und schnell Schlussfolgerungen in diesen Logiken gezogen werden können. Üblicherweise geschieht dies durch die Entwicklung eines implementierten Kalküls, und tatsächlich wurden in den vergangenen Jahren ...
openaire +3 more sources
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