Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jar/jar19.bht:"
@article{DBLP:journals/jar/AstrachanL97, author = {Owen L. Astrachan and Donald W. Loveland}, title = {The Use of Lemmas in the Model Elimination Procedure}, journal = {J. Autom. Reason.}, volume = {19}, number = {1}, pages = {117--141}, year = {1997}, url = {https://doi.org/10.1023/A:1005770705587}, doi = {10.1023/A:1005770705587}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/AstrachanL97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/BaumgartnerB97, author = {Peter Baumgartner and Stefan Br{\"{u}}ning}, title = {A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion}, journal = {J. Autom. Reason.}, volume = {19}, number = {2}, pages = {205--262}, year = {1997}, url = {https://doi.org/10.1023/A:1005812703468}, doi = {10.1023/A:1005812703468}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/BaumgartnerB97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/BundyGVW97, author = {Alan Bundy and Fausto Giunchiglia and Adolfo Villafiorita and Toby Walsh}, title = {Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem}, journal = {J. Autom. Reason.}, volume = {19}, number = {3}, pages = {319--346}, year = {1997}, url = {https://doi.org/10.1023/A:1005877613942}, doi = {10.1023/A:1005877613942}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/BundyGVW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/CaferraP97, author = {Ricardo Caferra and Nicolas Peltier}, title = {A New Technique for Verifying and Correcting Logic Programs}, journal = {J. Autom. Reason.}, volume = {19}, number = {3}, pages = {277--318}, year = {1997}, url = {https://doi.org/10.1023/A:1005878609884}, doi = {10.1023/A:1005878609884}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/CaferraP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/CorsiniR97, author = {Marc{-}Michel Corsini and Antoine Rauzy}, title = {Toupie: The {\(\mathrm{\mu}\)}-calculus over Finite Domains as a Constraint Language}, journal = {J. Autom. Reason.}, volume = {19}, number = {2}, pages = {143--171}, year = {1997}, url = {https://doi.org/10.1023/A:1005732517165}, doi = {10.1023/A:1005732517165}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/CorsiniR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/Giesl97, author = {J{\"{u}}rgen Giesl}, title = {Termination of Nested and Mutually Recursive Algorithms}, journal = {J. Autom. Reason.}, volume = {19}, number = {1}, pages = {1--29}, year = {1997}, url = {https://doi.org/10.1023/A:1005797629953}, doi = {10.1023/A:1005797629953}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/Giesl97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/Horwein97, author = {Karin H{\"{o}}rwein}, title = {Structuring Resolution Proofs by Introducing New Lemmata}, journal = {J. Autom. Reason.}, volume = {19}, number = {2}, pages = {173--203}, year = {1997}, url = {https://doi.org/10.1023/A:1005890730317}, doi = {10.1023/A:1005890730317}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/Horwein97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/Johnson97, author = {C. A. Johnson}, title = {Deduction Trees and the View Update Problem in Indefinite Deductive Databases}, journal = {J. Autom. Reason.}, volume = {19}, number = {1}, pages = {31--85}, year = {1997}, url = {https://doi.org/10.1023/A:1005779507994}, doi = {10.1023/A:1005779507994}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/Johnson97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/McCune97, author = {William McCune}, title = {Solution of the Robbins Problem}, journal = {J. Autom. Reason.}, volume = {19}, number = {3}, pages = {263--276}, year = {1997}, url = {https://doi.org/10.1023/A:1005843212881}, doi = {10.1023/A:1005843212881}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/McCune97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/NarendranO97, author = {Paliath Narendran and Friedrich Otto}, title = {Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories}, journal = {J. Autom. Reason.}, volume = {19}, number = {1}, pages = {87--115}, year = {1997}, url = {https://doi.org/10.1023/A:1005764526878}, doi = {10.1023/A:1005764526878}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/NarendranO97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/SturgillS97, author = {David B. Sturgill and Alberto Maria Segre}, title = {Nagging: {A} Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference}, journal = {J. Autom. Reason.}, volume = {19}, number = {3}, pages = {347--376}, year = {1997}, url = {https://doi.org/10.1023/A:1005885725562}, doi = {10.1023/A:1005885725562}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/SturgillS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.