{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:40Z","timestamp":1761610360444,"version":"build-2065373602"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5688,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(05)82556-3","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"127-146","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["The OMRS Project: State of the Art"],"prefix":"10.1016","volume":"15","author":[{"given":"Fausto","family":"Giunchiglia","sequence":"first","affiliation":[]},{"given":"Piergiorgio","family":"Bertoli","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Coglio","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1998","series-title":"From Integrated Reasoning Specialists to \u201cPlug-and-Play\u201d Reasoning Components","author":"Armando","key":"10.1016\/S1571-0661(05)82556-3_BIB1"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB2","article-title":"The control component of open mechanized reasoning systems","author":"Armando","year":"1998","journal-title":"Technical report, DIST"},{"year":"1990","series-title":"Category Theory for Computing Science","author":"Barr","key":"10.1016\/S1571-0661(05)82556-3_BIB3"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB4","unstructured":"P.G. Bertoli. Using OMRS in practice: a case study with acl2. PhD thesis, Computer Science Dept., University Rome 3, Rome, 1998."},{"key":"10.1016\/S1571-0661(05)82556-3_BIB5","doi-asserted-by":"crossref","unstructured":"P.G. Bertoli, J. Calmet, and K. Homann F. Giunchiglia. Specification and Integration of Theorem Provers and Computer Algebra Systems. Technical Report 9804-03, IRST, Trento, Italy, April 1998. To appear in the proceedings of AISC'98 \u2014 Fourth International Conference On Artificial Intelligence and Symbolic Computation.","DOI":"10.1007\/BFb0055905"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB6","unstructured":"W. R. Bevier. A Verified Operating System Kernel. PhD thesis, University of Texas at Austin, 1987. Also available through Computational Logic, Inc., Suite 290, 1717 West Sixth Street, Austin, TX 78703."},{"key":"10.1016\/S1571-0661(05)82556-3_BIB7","series-title":"Automated Theorem Proving: After 25 Years","first-page":"133","article-title":"A Mechanical Proof of the Turing Completeness of Pure Lisp","author":"Boyer","year":"1984"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB8","series-title":"Proc. of the 11th Conference on Automated Deduction","first-page":"416","article-title":"Automated correctness proofs of machine code programs for a commercial microprocessor","author":"Boyer","year":"1992"},{"year":"1979","series-title":"A Computational Logic","author":"Boyer","key":"10.1016\/S1571-0661(05)82556-3_BIB9"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB10","first-page":"83","article-title":"Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic","volume":"11","author":"Boyer","year":"1988","journal-title":"Machine Intelligence"},{"issue":"2","key":"10.1016\/S1571-0661(05)82556-3_BIB11","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","article-title":"Symbolic Model Checking: 1020 States and Beyond","volume":"98","author":"Burch","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB12","unstructured":"A. Coglio. Definizione di un formalismo per la specifica delle strategie di inferenza dei sistemi di ragionamento meccanizzato e sua applicazione ad un sistema allo stato dell'arte. Master Thesis DIST - University of Genoa (Italy), 1996."},{"key":"10.1016\/S1571-0661(05)82556-3_BIB13","article-title":"Composing and Controlling Search in Reasoning Theories using Mappings","author":"Coglio","year":"1998","journal-title":"Technical report, IRST- Technical report, IRST, Trento, Italy"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB14","unstructured":"A. Coglio, F. Giunchiglia, P. Pecchiari, and C. Talcott. A Logic Level Specification of the NQTHM Simplification Process. Technical Report 9700-48, DIST - University of Genova, Genova, Italy, 1997. Also IRST-Technical Report 9706-07, IRST, Trento, Italy."},{"year":"1986","series-title":"Implementing mathematics with the Nuprl development system","author":"Constable","key":"10.1016\/S1571-0661(05)82556-3_BIB15"},{"year":"1986","series-title":"Implementing Mathematics with the NuPRL Proof Development System","author":"Constable","key":"10.1016\/S1571-0661(05)82556-3_BIB16"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB17","article-title":"Meeting a challenge of Knuth","author":"Cowles","year":"1993","journal-title":"Technical Report 286, Computational Logic Inc., Austin, Texas"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB18","article-title":"The GETFOL Manual - GETFOL version 1","author":"Giunchiglia","year":"1992","journal-title":"Technical Report 92-0010, DIST - University of Genova, Genoa, Italy"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB19","unstructured":"F. Giunchiglia, P. Pecchiari, and C. Talcott. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems. Technical Report 9409-15, IRST, Trento, Italy, 1994. Also published as Stanford Computer Science Department Technical note number STAN-CS-TN-94-15, Stanford University. Short version published in Proc. of the First International Workshop on Frontiers of Combining Systems (FroCoS'96), Munich, Germany, March 1996."},{"key":"10.1016\/S1571-0661(05)82556-3_BIB20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","article-title":"Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations","volume":"105","author":"Goguen","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB21","unstructured":"Joseph Goguen, Timothy Winkler, Jos\u00e9 Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. Technical Report SRI-CSL-92-03, SRI International, Computer Science Laboratory, 1993. To appear in J.A. Goguen, editor, Applications of Algebraic Specification Using OBJ, Cambridge University Press."},{"key":"10.1016\/S1571-0661(05)82556-3_BIB22","doi-asserted-by":"crossref","unstructured":"M. Gordon. HOL: A proof generating system for higher-order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification, and Synthesis. Kluwer, 1987.","DOI":"10.1007\/978-1-4613-2007-4_3"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB23","series-title":"Number 78 in Lecture Notes in Computer Science","article-title":"Edinburgh LCF: A mechanized logic of computation","author":"Gordon","year":"1979"},{"year":"1991","series-title":"Design and Validation of Computer Protocols","author":"Holzmann","key":"10.1016\/S1571-0661(05)82556-3_BIB24"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB25","series-title":"Third International Conf. of Rewriting Techniques and Applications","article-title":"An Overview of RRL (Rewrite Rule Laboratory)","author":"Kapur","year":"1989"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB26","unstructured":"M. Kaufmann and J. S. Moore. acl2 Version 1.8 User's Manual. Available on line at http:\/\/www.cs.utexas.edu\/users\/moore\/acl2\/index.html."},{"key":"10.1016\/S1571-0661(05)82556-3_BIB27","series-title":"Number 5 in Graduate Texts in Mathematics Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","article-title":"Categories for the Working Mathematician","author":"Saunders Mac Lane","year":"1971"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB28","article-title":"Rewriting logic as a logical and semantic framework","author":"Mart\u00ed-Oliet","year":"1993","journal-title":"Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB29","series-title":"Logic Colloquium'87","first-page":"275","article-title":"General logics","author":"Jos\u00e9 Meseguer","year":"1989"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB30","first-page":"748","article-title":"PVS: A prototype verification system","author":"Owre","year":"1992","journal-title":"Automated Deduction--CADE-11, volume 607 of Lecture Notes in Artificial Intelligence"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB31","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00248324","article-title":"The Foundation of a Generic Theorem Prover","volume":"5","author":"Paulson","year":"1989","journal-title":"Journal of Automated Reasoning"},{"year":"1994","series-title":"Isabelle - a Generic Theorem Prover","author":"Paulson","key":"10.1016\/S1571-0661(05)82556-3_BIB32"},{"year":"1991","series-title":"Basic Category Theory for Computer Scientists","author":"Pierce","key":"10.1016\/S1571-0661(05)82556-3_BIB33"},{"year":"1965","series-title":"Natural Deduction: A Proof-theoretical Study","author":"Prawitz","key":"10.1016\/S1571-0661(05)82556-3_BIB34"},{"issue":"1","key":"10.1016\/S1571-0661(05)82556-3_BIB35","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF00263446","article-title":"A mechanical proof of quadratic reciprocity","volume":"8","author":"Russinoff","year":"1992","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB36","article-title":"Specification and verification of gate-level VHDL models of synchronous and asynchronous circuits","author":"Russinoff","year":"1994","journal-title":"Technical Report 99, Computational Logic Inc., Austin, Texas"},{"issue":"3","key":"10.1016\/S1571-0661(05)82556-3_BIB37","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1145\/44483.44484","article-title":"A mechanical proof of the Church-Rosser theorem","volume":"35","author":"Shankar","year":"1988","journal-title":"JACM"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB38","doi-asserted-by":"crossref","unstructured":"Y. Srinivas and R. Jullig. Specware (TM): Formal support for composing software. In Proceedings of the Conference on Mathematics of Program Construction, Kloster Irsee, Germany, 1995.","DOI":"10.1007\/3-540-60117-1_22"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB39","unstructured":"C. Talcott. Database of automated reasoning systems. Accessible by anonymous ftp or WWW. URL = file:\/\/sail.stanford.edu\/pub\/clt\/ARS."},{"key":"10.1016\/S1571-0661(05)82556-3_BIB40","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(93)90240-T","article-title":"A theory of binding structures and its applications to rewriting","volume":"112","author":"Talcott","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB41","article-title":"The SRI Specification and Verification System, Users Guide","author":"The SRI Staff","year":"1986","journal-title":"Technical report, SRI International"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB42","article-title":"A Users Manual for FOL","author":"Weyhrauch","year":"1977","journal-title":"Technical Report STAN-CS-77-432, Stanford University Computer Science Department"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB43","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0004-3702(80)90015-6","article-title":"Prolegomena to a theory of formal reasoning","volume":"13","author":"Weyhrauch","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(05)82556-3_BIB44","unstructured":"W.D. Young. Verifying the interactive convergence clock synchronization algorithm using the Boyer-Moore theorem prover. Contractor Report 189649, NASA."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:05Z","timestamp":1761610085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":44,"alternative-id":["S1571066105825563"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82556-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The OMRS Project: State of the Art","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)82556-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}