A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
otterlib - a C library for theorem proving - Flavio Protasio Ribeiro (Correct)
....an overview of ordered resolution. The paramodulation rule was developed in [Robinson and Wos 1969] to better treat the equality predicate. Paramodulation with resolution and factoring under the presence of the re exivity axiom is refutation complete for rst order logic. We refer the reader to [Robinson and Voronkov 2001] for an overview of theorem proving. 3.2.1 Binary resolution A r :s B (A B)unif(r; s) P (x) Q(x; y) P (a) R(x) P (a; x) R(y) 3.2.2 UR Resolution Consists of the simultaneous binary resolution between n unit clauses (satellites) and a clause with n 1 literals (nucleus) No ....
Robinson A., Voronkov A. (editors). Handbook of Automated Reasoning, Vol. I. Elsevier Science, Holland.
Resolution in Modal, Description and Hybrid Logic - Areces, de Nivelle, de Rijke (2002) (Correct)
....in [36] see [33] for a linear time version) plays a fundamental role in handling this complexity, and in using it to guide the search. The eld of resolution based rst order theorem proving has developed into a community of its own, with an impressive collection of methods and optimizations [9, 34]. In contrast to the popularity of resolution based methods in rst order logic, modern modal theorem provers are generally based on tableau methods [15] Nowadays, resolution and modal languages seem to be related only when indirect methods are used. In translation based resolution calculi for ....
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers B. V., 2001.
The formal method known as B and a sketch for its implementation - Kaijanaho (2002) (Correct)
.... artificial intelligence, such as Nils Nilsson s [88] and George Luger and William Stubblefield s [78] More thoroghly it is described in Wos, Overbeek, Lusk and Boyle s book [126] A thoroughly theoretical but a little outdated account is given by Loveland [77] The recent North Holland handbook [100] is an advanced treatment. 4.1 The limits of automated reasoning The ultimate goal of research in the field of automated reasoning is to find an efficient decision procedure for each interesting logical system. In practice, this is an unattainable goal: In the case of propositional calculus, a ....
....procedure and a refutation procedure to fail to terminate; some contingent formulae are such. The fact that they indeed do exist follows from Church and Turing s theorem discussed in the previous chapter. Note that this terminology (uniformly used in publications in automated reasoning, such as [88, 78, 126, 77, 100]) may be confusing. A refutable formula is one that is not true in all possible worlds and interpretations. However, a refutation procedure does not detect refutable formulae but contradictions Higher order logic does not even have a proof procedure; this follows straightforwardly from ....
Alan Robinson and Andrei Voronkov (eds.). Handbook of Automated Reasoning. Amsterdam: Elsevier (North-Holland), 2001.
Higher-Order Positive Set Constraints - Goubault-Larrecq (2002) (Correct)
....syntax resembling set constraints for the higher order case, and will be content with just a clausal format. To decide clausal forms representing positive higher order set constraints, we shallmake extensive use of resolution theorem proving techniques. A comprehensive reference is the handbook [23]. Using resolution to decide subclasses of first order logic formulas was pioneered by Joyner [18] and by Maslov, see [10] Standard refinements of resolution used in this area are hyperresolution and ordered refinements. 2 Preliminaries Simple types, or types for short in this paper, are given ....
J. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. NorthHolland, 2001.
Alternating Two-Way AC-Tree Automata - Goubault-Larrecq, Verma (2002) (Correct)
....In the general case, only the case of unions is trivial, and we concentrate on the difficult intersectionemptiness problem, leaving closure properties to future work. As a final note, we shall make extensive use of resolution theorem proving techniques. A comprehensive reference is the handbook [38]. Using resolution techniques to decide subclasses of first order logic formulas was pioneered by Joyner [25] and earlier by Maslov, see [15] Standard refinements of resolution used in this area are hyperresolution and ordered refinements. Note that our decision algorithm of Section 6 is not ....
J. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. NorthHolland, 2001.
Logics for Mazurkiewicz Traces - Leucker (2002) (4 citations) (Correct)
....Val91] As may be guessed, the importance of these methods lies in the fact that the computational resources required for the verification task can often be dramatically reduced. In general, two approaches for the verification of systems can be distinguished: model checking and theorem proving [RV01] Several case studies have shown that especially model checking admits to find errors during the design process (cf. CW96] for an overview) In this thesis we focus on model checking. Model checking The crucial virtue of model checking is that it proceeds automatically. The implementation as ....
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier, 2001.
Alternating Two-Way AC-Tree Automata - Goubault-Larrecq, Verma (2002) (Correct)
....is trivial, and we concentrate on the intersection emptiness problem; this is tricky enough. Also, we deal with the theory of many AC and AC1 symbols, not just one. As a final note, we shall make extensive use of resolution theorem proving techniques. A comprehensive reference is the handbook [36]. Using resolution techniques to decide subclasses of first order logic formulas was pioneered by Joyner [23] and earlier by Maslov, see [14] Standard refinements of resolu2 tion used in this area are hyperresolution and ordered refinements. Note that our decision algorithm of Section 5 is not ....
J. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. NorthHolland, 2001.
Resolution in Modal, Description and Hybrid Logic - Areces, de Nivelle, de Rijke (Correct)
....in [36] see [33] for a linear time version) plays a fundamental role in handling this complexity, and in using it to guide the search. The eld of resolution based rst order theorem proving has developed into a community of its own, with an impressive collection of methods and optimizations [9, 34]. In contrast to the popularity of resolution based methods in rst order logic, modern modal theorem provers are generally based on tableau methods [15] Nowadays, resolution and modal languages seem to be related only when indirect methods are used. In translation based resolution calculi for ....
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers B. V., 2001. To appear.
Reasoning - Dix (1998) (Correct)
.... and non classical logics, we refer the interested reader to the following handbooks: Handbook of Logic in Artificial Intelligence and Logic Programming [GHR99] Handbook of Logic in Computer Science [AGM99] Handbook of Philosophical Logic, 2nd Edition [GG99] and Handbook of Automated Reasoning [Rob98]. All contain up to date information on the treated subject. In particular, we suggest [Gab94] Gin94] Mak94] RS92] BD98] DFN98] BDK97] is a recent book on Nonmonotonic Reasoning and treats most aspects on an post graduate or PhD level. 34 ....
A. Robinson, J. A. and Voronkov, editor. Handbook of Automated Reasoning, volume 1-2. Elsevier Science, 1998.
Heterogeneous Active Agents, III: Polynomially Implementable.. - Eiter, al. (1999) (Correct)
....on top of the code. A series of successively more sophisticated declarative semantics for agent programs have been described, whose epistemic appeal comes at a price of increased computational complexity. The creator of the agent can choose which semantics his agent will use. Every agent in the (Eiter et al. 1999) framework has an associated notion of state, and this state includes certain special data structures shown in Figure 1. While most of these data structures are not needed for this paper, the message box is critical. An agent s state changes when it receives messages from other agents or from ....
....engaged in a cycle consisting of the three steps listed below. S1) Evaluate state changes, S2) Determine what actions to take, S3) Concurrently execute the selected actions. Step (2) above requires that the agent computes certain kinds of semantical structures called status sets, described in (Eiter et al. 1999), and also briefly described in the Appendix of this paper. Of the alternative semantics described in (Eiter et al. 1999) it was argued that the best ones were all defined in terms of a reasonable status set semantics. However, computing such reasonable status sets is intractable in general. ....
[Article contains additional citation context not shown here]
In A. Voronkov and A. Robinson (Eds.), Handbook of Automated Reasoning. Elsevier-Science-Press. to appear. Eiter, T., V. Subrahmanian, and G. Pick (1999). Heterogeneous Active Agents, I: Semantics. Artificial Intelligence 108(1-2), 179--255.
A Principle for Incorporating Axioms into the First-Order.. - Schmidt, Hustadt (2004) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier, 2001.
A Survey of Decidable First-Order Fragments and.. - Hustadt, Schmidt.. (2004) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier, 2001.
Centro Per La Ricerca - Scientifica Tecnologica Povo (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers, 2001.
Subset Types and Partial Functions - Stump (2003) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.
From Rogue to MicroRogue - Stump, Besand, Brodman, Hseu.. (2000) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.
Imperative LF Meta-Programming - Stump (2004) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.
Rogue Decision Procedures - Stump, Deivanayagam, Kathol.. (2003) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.
Finite Model Building: Improvements and Comparisons - Tammet (Correct)
No context found.
Robinson, A.J., Voronkov, A., editors. Handbook of Automated Reasoning. MIT Press, 2001.
A Model Generation Style Completeness Proof for Constraint.. - Giese (2001) (Correct)
No context found.
Alan Robinson and Andrei Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science B.V., 2001.
Controlled Model Exploration - Infante-Lopez, Areces, de Rijke (2003) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers, 2001.
Towards Scientific Information Disclosure through.. - Caracciolo, de Rijke.. (2002) (Correct)
No context found.
J. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier, 2001.
Extending Classical Theorem Proving for the Semantic Web - Tammet (Correct)
No context found.
Robinson, A.J., Voronkov, A., editors. Handbook of Automated Reasoning. MIT Press, 2001.
Experiments on Supporting Interactive Proof Using Resolution - Meng, Paulson (2004) (2 citations) (Correct)
No context found.
Alan Robinson and Andrei Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science, 2001.
Logic Programming: The Case of Description and Hybrid Logic - Areces (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers B. V., 2000. To appear.
MEGA | The Maximizing Expected Generalization Algorithm - For Learning Complex (Correct)
No context found.
J. A. Robinson and A. Voronkov. Handbook of Automated Reasoning. Elsevier Science Publishers, 2000. 35
Little Engines of Proof - Shankar (2002) (5 citations) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science, 2001.
Controlled Model Exploration - Infante-Lopez, Areces, de Rijke (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers, 2001.
Verification of Hardware Systems with First-Order Logic - Claessen, Hähnle.. (2002) (Correct)
No context found.
Robinson, A., Voronkov, A., eds.: Handbook of Automated Reasoning. Elsevier Science B.V. (2001)
Verification of Hardware Systems with First-Order Logic - Claessen, Hähnle.. (2002) (Correct)
No context found.
Robinson, A., Voronkov, A., eds.: Handbook of Automated Reasoning. Elsevier Science B.V. (2001)
A Note on the Completeness of Certain Refinements of Resolution - Goubault-Larrecq (2002) (Correct)
No context found.
J. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. NorthHolland, 2001.
Decomposing Modal Logic - Infante-Lopez, Areces, de Rijke (2002) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers, 2001. 15
Faster Proof Checking in the Edinburgh Logical Framework - Stump, Dill (2002) (2 citations) (Correct)
No context found.
A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.
A Model Generation Style Completeness Proof for Constraint.. - Giese (2002) (Correct)
No context found.
Alan Robinson and Andrei Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science B.V., 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC