{"type":"ScholarlyArticle","title":"Ordering-Based Strategies for Horn Clauses","authors":[{"name":"Nachum Dershowitz","slug":"nachum-dershowitz","given":"Nachum","family":"Dershowitz","affiliation":"Department of Computer Science University of Illinois at Urbana-Champaign 1304 West Springfield A venue Urbana , IL 61801 , U.S.A."}],"abstract":"Two new theorem-proving procedures for equational Horn clauses are presented. The largest literal is selected for paramodulation in both strategies, except that one method treats positive literals as larger than negative ones and results in a unit strategy. Both use term orderings to restrict paramodulation to potentially maximal sides of equations and to increase the amount of allowable simplification (demodulation). Completeness is shown using proof orderings.","doi":null,"url":"https://ijcai.org/proceedings/1991/18","pdf":"https://ijcai.org/proceedings/1991/0018.pdf","markdown":"https://ijcai.org/proceedings/1991/18.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/18","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":18,"pages":{"first":118,"last":124},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Bachmair and Ganzinger, 1990] Leo Bachmair and Harald Ganzinger. Completion of first-order clauses with equality. In M. Okada, editor, Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems, Montreal, Canada, June 1990. Lecture Notes in Computer Science, Springer, Berlin, to appear.","title":"Completion of first-order clauses with equality","authors":"Ganzinger Bachmair, Leo Bachmair, Harald Ganzinger","year":"1990","venue":"Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bachmair et a/., 1986] Leo Bachmair, Nachum Der- showitz, and Jieh Hsiang. Orderings for equational proofs. In Proceedings of the IEEE Symposium on Log- ic in Computer Science, pages 346-357, Cambridge, MA, June 1986.","title":"Orderings for equational proofs","authors":"Leo Bachmair, Nachum Dershowitz, Jieh Hsiang","year":"1986","venue":"Proceedings of the IEEE Symposium on Logic in Computer Science","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bachmair et a/., 1989] Leo Bachmair, Nachum Der- showitz, and David A. Plaisted . Completion without failure. In H. A•it-Kaci and M. Nivat, editors, Resolu- tion of Equations in Algebraic Structures 2: Rewriting Techniques, chapter 1, pages 1-30. Academic Press, New York, 1989.","title":"Completion without failure","authors":"Leo Bachmair, Nachum Dershowitz, David A Plaisted","year":"1989","venue":"Resolution of Equations in Algebraic Structures 2: Rewriting Techniques","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bertling and Ganzinger, 1989] Hubert Bertling and Harald Ganzinger. Completion-time optimization of rewrite-time goal solving. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications, pages 45-58, Chapel Hill; NC, April1989. Vol. 355 of Lecture Notes in Computer Science, Springer, Berlin.","title":"Completion-time optimization of rewrite-time goal solving","authors":"Ganzinger Bertling, Hubert Bertling, Harald Ganzinger","year":"1989","venue":"Proceedings of the Third International Conference on Rewriting Techniques and Applications","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bertling, 1990] Hubert Bertling. Knuth-Bendix com- pletion of Horn clause programs for restricted linear resolution and paramodulation. In S. Kaplan and M. Okada, editors, Extended Abstracts of the Second International Workshop on Conditional and Typed Rewriting Systems, pages 89-95, Montreal, Canada, June 1990. Revised version to appear in Lecture Notes in Computer Science, Springer, Berlin.","title":"Knuth-Bendix completion of Horn clause programs for restricted linear resolution and paramodulation","authors":"Hubert Bertling","year":"1990","venue":"Extended Abstracts of the Second International Workshop on Conditional and Typed Rewriting Systems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Boyer, 1971] Robert S. Boyer. Locking: A restriction of resolution. Ph.d., University of Texas at Austin, Austin, TX, 1971.","title":"Locking: A restriction of resolution","authors":"Robert S Boyer","year":"1971","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brown, 1975] Thomas Carl Brown, Jr. A Structured Design-Method for Specialized Proof Procedures. PhD thesis, California Institute of Technology, Pasadena, CA, 1975.","title":"A Structured Design-Method for Specialized Proof Procedures","authors":"Thomas Carl Brown, Jr","year":"1975","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dershowitz and Jouannaud, 1990] Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Hand book of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6, pages 243-320. North-Holland, Amster- dam, 1990.","title":"Rewrite systems","authors":"Nachum Dershowitz, Jean-Pierre Jouannaud","year":"1990","venue":"Hand book of Theoretical Computer Science B: Formal Methods and Semantics","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dershowitz and Manna, 1979] Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465- 476, August 1979.","title":"Proving termination with multiset orderings","authors":"Manna Dershowitz, Nachum Dershowitz, Zohar Manna","year":"1979","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dershowitz and Okada, 1988] Nachum Dershowitz and Mitsuhiro Okada. Proof-theoretic techniques and the theory of rewriting. In Proceedings of the Third IEEE Symposium on Logic in Computer Science, pages 104- 111, Edinburgh, Scotland, July 1988.","title":"Proof-theoretic techniques and the theory of rewriting","authors":"Okada Dershowitz, Nachum Dershowitz, Mitsuhiro Okada","year":"1988","venue":"Proceedings of the Third IEEE Symposium on Logic in Computer Science","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dershowitz, 1987] Nachum Dershowitz. Termination of rewriting. J. of Symbolic Computation, 3(1&2):69- 115, February/ April 1987. Corrigendum: 4, 3 (De- cember 1987) , 409-410.","title":"Termination of rewriting","authors":"Nachum Dershowitz","year":"1987","venue":"J. of Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dershowitz, 1990] Nachum Dershowitz . A maximal- literal unit strategy for Horn clauses. InS. Kaplan and M. Okada, editors, Extended Abstracts of the Second International Workshop on Conditiona l and Typed Rewriting Systems, pages 21-27, Montreal, Canada, June 1990. Concordia University. Revised version to appear in Lecture Notes in Computer Science, Springer, Berlin. [Furbach, 1987] Ulrich Furbach . Oldy but goody: Paramodulation revisited. In Morik, editor, Proceed- ings of the GI Workshop on Artificial Intelligence, pages 195-200, 1987. Vol. 152 of Informatik Fach- berichte. [Ganzinger, 1987] Harald Ganzinger. A completion pro- cedure for conditional equations. In S. Kaplan and J .-P. Jouannaud, editors, Proceedings of the First In- ternational Workshop on Conditional Term Rewriting Systems, pages 62-83, Orsay, France, July 1987 . Vol. 308 of Lecture Notes in Computer Science, Springer, Berlin (1988).","title":"A maximalliteral unit strategy for Horn clauses","authors":"Nachum Dershowitz, Harald Ganzinger","year":"1987","venue":"Extended Abstracts of the Second International Workshop on Conditiona l and Typed Rewriting Systems","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Henschen and Wos, 1974] L. Henschen and L. Wos. U- nit refutations and Horn sets. J. of the Association for Computing Machinery, 21:590-605, 1974.","title":"Unit refutations and Horn sets","authors":"L Henschen, L Wos","year":"1974","venue":"J. of the Association for Computing Machinery","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hsiang and Rusinowitch, 1986] Jieh Hsiang and Michael Rusinowitch. A new method for establish ing refutational completeness in theorem proving. In J . H. Siekmann, editor, Proceedings of the Eighth International Conference on Automated Deduction, pages 141-152, Oxford, England, July 1986. Vol. 230 of Lecture Notes in Computer Science, Springer, Berlin. [Hsiang and Rusinowitch, 1987] Jieh Hsiang and Michael Rusinowitch. On word problems in equational theories. In T. Ottmann, editor, Proceedings of the Fourteenth EATCS International Conference on Automata, Languages and Programming, pages 54- 71, Karlsruhe, West Germany, July 1987. Vol. 267 of Lecture Notes in Computer Science, Springer, Berlin.","title":"A new method for establish ing refutational completeness in theorem proving","authors":"Jieh Hsiang, Michael Rusinowitch","year":"1986","venue":"Proceedings of the Fourteenth EATCS International Conference on Automata, Languages and Programming","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Jouannaud and Okada, 1991] Jean-Pierre Jouannaud and Mitsuhiro Okada. Satisfiability of systems of ordi- nal notations with the subterm property is decidable. In Proceedings of the Eighteenth EATCS Colloquium on Automata, Languages and Programming, Madrid, Spain, July 1991. To appear.","title":"Satisfiability of systems of ordinal notations with the subterm property is decidable","authors":"Okada Jouannaud, Jean-Pierre Jouannaud, Mitsuhiro Okada","year":"1991","venue":"Proceedings of the Eighteenth EATCS Colloquium on Automata, Languages and Programming","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kaplan, 1987] Stephane Kaplan. Simplifying condition- al term rewriting systems: Unification, termination and confluence. J. Symbolic Computation, 4(3):295- 334, December 1987.","title":"Simplifying conditional term rewriting systems: Unification, termination and confluence","authors":"Stephane Kaplan","year":"1987","venue":"J. Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Knuth and Bendix, 1970] Donald E. Knuth and P. B. Bendix. Simple word problems in universal alge- bras. In J . Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, U. K., 1970. Reprinted in Automation of Reasoning 2, Springer, Berlin, pp. 342-376 (1983).","title":"Simple word problems in universal algebras","authors":"Donald E Knuth, P B Bendix","year":"1970","venue":"Computational Problems in Abstract Algebra","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kounalis and Rusinowitch, 1987] Emmanuel Kounalis and Michael Rusinowitch. On word problems in Horn theories. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings of the First International Workshop on Conditional Term Rewriting Systems, pages 144-160, Orsay, France, July 1987. Vol. 308 of Lecture Notes in Computer Science, Springer, Berlin (1988).","title":"On word problems in Horn theories","authors":"Emmanuel Kounalis, Michael Rusinowitch","year":"1987","venue":"Proceedings of the First International Workshop on Conditional Term Rewriting Systems","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lankford, 1975] Dallas S. Lankford. Canonical infer- ence. Memo ATP-32, Automatic Theorem Proving Project, University of Texas, Austin, TX, December 1975.","title":"Canonical inference","authors":"Dallas S Lankford","year":"1975","venue":"Memo ATP-32, Automatic Theorem Proving Project","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Nieuwenhuis and Orejas, 1990] Robert Nieuwenhuis and Fernando Orejas. Clausal rewriting. In S. Kaplan and M. Okada, editors, Extended Abstracts of the Second International Workshop on Conditional and Typed Rewriting Systems, pages 81-88, Montreal, Canada, June 1990. Concordia University. Revised version to appear in Lecture Notes in Computer Science, Springer, Berlin.","title":"Clausal rewriting","authors":"Robert Nieuwenhuis, Fernando Orejas","year":"1990","venue":"Extended Abstracts of the Second International Workshop on Conditional and Typed Rewriting Systems","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Paul, 1986] Etienne Paul. On solving the equality prob- lem in theories defined by Horn clauses. Theoretical Computer Science, 44(2):127-153, 1986.","title":"On solving the equality problem in theories defined by Horn clauses","authors":"Etienne Paul","year":"1986","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Robinson and Wos, 1969] G. Robinson and L. Wos. Paramodulation and theorem-proving in first order theories with equality. In B. Meltzer and D. Michie, editors, Machine Intelligence ../, pages 135-150. Edin- burgh University Press, Edinburgh, Scotland, 1969.","title":"Paramodulation and theorem-proving in first order theories with equality","authors":"G Robinson, L Wos","year":"1969","venue":"Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Rusinowitch, 1989] Michael Rusinowitch. Demonstration Automatique: 124 Automated Reasoning Techniques de rUcriture. InterEditions, Paris, France, 1989.","title":"Demonstration Automatique: 124 Automated Reasoning Techniques de rUcriture","authors":"Michael Rusinowitch","year":"1989","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Zhang and Kapur, 1988] Hantao Zhang and Deepak Kapur. First-order theorem proving using conditional equations. In E. Lusk and R. Overbeek, editors, Proceedings of the Ninth International Conference on Automated Deduction, pages 1-20, Argonne, Illinois, May 1988. Vol. 310 of Lecture Notes in Computer Science, Springer, Berlin.","title":"First-order theorem proving using conditional equations","authors":"Kapur Zhang, Hantao Zhang, Deepak Kapur","year":"1988","venue":"Proceedings of the Ninth International Conference on Automated Deduction","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}