Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/amai/Bioch98,
  author       = {Jan C. Bioch},
  title        = {Dualization, Decision Lists and Identification of Monotone Discrete
                  Functions},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {69--91},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018993014297},
  doi          = {10.1023/A:1018993014297},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Bioch98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/BittnerS98,
  author       = {Thomas Bittner and
                  John G. Stell},
  title        = {A Boundary-Sensitive Approach to Qualitative Location},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {93--114},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018945131135},
  doi          = {10.1023/A:1018945131135},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/BittnerS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/BlackburnT98,
  author       = {Patrick Blackburn and
                  Miroslava Tzakova},
  title        = {Hybridizing Concept Languages},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {23--49},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018988913388},
  doi          = {10.1023/A:1018988913388},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/BlackburnT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/EngelfrietHT98,
  author       = {Joeri Engelfriet and
                  Heinrich Herre and
                  Jan Treur},
  title        = {Nonmonotonic Reasoning with Multiple Belief Sets},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {225--248},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018909517931},
  doi          = {10.1023/A:1018909517931},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/EngelfrietHT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/HaDVH98,
  author       = {Vu A. Ha and
                  AnHai Doan and
                  Van H. Vu and
                  Peter Haddawy},
  title        = {Geometric Foundations for Interval-Based Probabilities},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {1--21},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018936829318},
  doi          = {10.1023/A:1018936829318},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/HaDVH98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/JeavonsCP98,
  author       = {Peter Jeavons and
                  David A. Cohen and
                  Justin Pearson},
  title        = {Constraints and Universal Algebra},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {51--67},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018941030227},
  doi          = {10.1023/A:1018941030227},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/JeavonsCP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/KenyonP98,
  author       = {Claire Kenyon and
                  H{\'{e}}l{\`{e}}ne Paugam{-}Moisy},
  title        = {Multilayer Neural Networks and Polyhedral Dichotomies},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {115--128},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018997115206},
  doi          = {10.1023/A:1018997115206},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/KenyonP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Mayoraz98,
  author       = {Eddy Mayoraz},
  title        = {On the Complexity of Recognizing Regions Computable by Two-Layered
                  Perceptrons},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {129--153},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018949232044},
  doi          = {10.1023/A:1018949232044},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Mayoraz98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/MoulinK98,
  author       = {Bernard Moulin and
                  Driss Kettani},
  title        = {Route Generation and Description Using a Logical and an Analogical
                  Framework},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {155--179},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018901316114},
  doi          = {10.1023/A:1018901316114},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/MoulinK98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Schmitt98,
  author       = {Michael Schmitt},
  title        = {On Computing Boolean Functions by a Spiking Neuron},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {181--191},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018953300185},
  doi          = {10.1023/A:1018953300185},
  timestamp    = {Wed, 20 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/Schmitt98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/SloanTT98,
  author       = {Robert H. Sloan and
                  Ken Takata and
                  Gy{\"{o}}rgy Tur{\'{a}}n},
  title        = {On Frequent Sets of Boolean Matrices},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {193--209},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018905417023},
  doi          = {10.1023/A:1018905417023},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/SloanTT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/WagnerLB98,
  author       = {Israel A. Wagner and
                  Michael Lindenbaum and
                  Alfred M. Bruckstein},
  title        = {Efficiently Searching a Graph by a Smell-Oriented Vertex Process},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {24},
  number       = {1-4},
  pages        = {211--223},
  year         = {1998},
  url          = {https://doi.org/10.1023/A:1018957401093},
  doi          = {10.1023/A:1018957401093},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/WagnerLB98.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.