Search dblp for Publications

export results for "toc:db/journals/amai/amai6.bht:"

 download as .bib file

@article{DBLP:journals/amai/Clote92,
  author       = {Peter Clote},
  title        = {{ALOGTIME} and a Conjecture of S. A. Cook},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {57--106},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531023},
  doi          = {10.1007/BF01531023},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Clote92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Dolan92,
  author       = {Peter Dolan},
  title        = {Undecidable Statements and Random Graphs},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {17--25},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531021},
  doi          = {10.1007/BF01531021},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Dolan92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Farmer92,
  author       = {William M. Farmer},
  title        = {The Kreisel Length-of-Proof Problem},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {27--55},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531022},
  doi          = {10.1007/BF01531022},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Farmer92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/FrancoDW92,
  author       = {John V. Franco and
                  J. Michael Dunn and
                  William H. Wheeler},
  title        = {Recent Work at the Interface of Logic, Combinatorics and Computer
                  Science},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {1--15},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531020},
  doi          = {10.1007/BF01531020},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/FrancoDW92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Goerdt92,
  author       = {Andreas Goerdt},
  title        = {Davis-Putnam Resolution versus Unrestricted Resolution},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {169--184},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531027},
  doi          = {10.1007/BF01531027},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Goerdt92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Hooker92,
  author       = {John N. Hooker},
  title        = {Generalized Resolution for 0-1 Linear Inequalities},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {271--286},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531033},
  doi          = {10.1007/BF01531033},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Hooker92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/HuTL92,
  author       = {T. H. Hu and
                  Chuan Yi Tang and
                  Richard C. T. Lee},
  title        = {An Average Case Analysis of a Resolution Principle Algorithm in Mechanical
                  Theorem Proving},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {235--251},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531030},
  doi          = {10.1007/BF01531030},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/HuTL92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/HuynhLL92,
  author       = {Tien Huynh and
                  Catherine Lassez and
                  Jean{-}Louis Lassez},
  title        = {Practical Issues on the Projection of Polyhedral Sets},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {4},
  pages        = {295--315},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01535523},
  doi          = {10.1007/BF01535523},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/HuynhLL92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/KrajicekT92,
  author       = {Jan Kraj{\'{\i}}cek and
                  Gaisi Takeuti},
  title        = {On Induction-Free Provability},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {107--125},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531024},
  doi          = {10.1007/BF01531024},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/KrajicekT92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Mantzivis92,
  author       = {Spyro{-}Giorgio Mantzivis},
  title        = {Circuits in Bounded Arithmetic, Part {I}},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {127--156},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531025},
  doi          = {10.1007/BF01531025},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Mantzivis92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Minoux92,
  author       = {Michel Minoux},
  title        = {The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {253--266},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531031},
  doi          = {10.1007/BF01531031},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Minoux92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Mundici92,
  author       = {Daniele Mundici},
  title        = {Turing Complexity of Behncke-Leptin C\({}^{\mbox{*}}\)-algebras with
                  a Two-Point Dual},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {287--293},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531034},
  doi          = {10.1007/BF01531034},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Mundici92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Panetta92,
  author       = {R. Lee Panetta},
  title        = {A Finite Intersection Property and the Loeb Measurability of Ultrafilters
                  on Hyperfinite Sets},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {267--270},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531032},
  doi          = {10.1007/BF01531032},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Panetta92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Rosenthal92,
  author       = {John W. Rosenthal},
  title        = {The Expected Complexity of Analytic Tableaux Analyses in Propositional
                  Calculus - {II}},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {201--234},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531029},
  doi          = {10.1007/BF01531029},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Rosenthal92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/RosenthalSK92,
  author       = {John W. Rosenthal and
                  Ewald Speckenmeyer and
                  Rainer Kemp},
  title        = {Exact Satisfiability, a Natural Extension of Set Partition and Its
                  Average Case Behavior},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {185--200},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531028},
  doi          = {10.1007/BF01531028},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/RosenthalSK92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/SimsB92,
  author       = {Michael H. Sims and
                  John L. Bresina},
  title        = {Purposive Discovery of Operators},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {4},
  pages        = {317--343},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01535524},
  doi          = {10.1007/BF01535524},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/SimsB92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/ThomasonA92,
  author       = {Richmond H. Thomason and
                  John M. Aronis},
  title        = {Hybridizing Nonmonotonic Inheritance with Theorem Proving},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {4},
  pages        = {345--365},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01535525},
  doi          = {10.1007/BF01535525},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/ThomasonA92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Urquhart92,
  author       = {Alasdair Urquhart},
  title        = {The Relative Complexity of Resolution and Cut-Free Gentzen Systems},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {1-3},
  pages        = {157--168},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01531026},
  doi          = {10.1007/BF01531026},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Urquhart92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/WhitleyDC92,
  author       = {L. Darrell Whitley and
                  Rajarshi Das and
                  Curtis Crabb},
  title        = {Tracking Primary Hyperplane Competitors During Genetic Search},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {6},
  number       = {4},
  pages        = {367--388},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01535526},
  doi          = {10.1007/BF01535526},
  timestamp    = {Tue, 11 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/WhitleyDC92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.