Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/amai/AndersenP01,
  author       = {Kim Allan Andersen and
                  Daniele Pretolani},
  title        = {Easy Cases of Probabilistic Satisfiability},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {1},
  pages        = {69--91},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1012332915908},
  doi          = {10.1023/A:1012332915908},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/AndersenP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/BarriosMPR01,
  author       = {Dolores Barrios Rolan{\'{\i}}a and
                  Daniel Manrique and
                  M. Rosario Plaza and
                  Juan Rios},
  title        = {An Algebraic Model for Generating and Adapting Neural Networks by
                  Means of Optimization Methods},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {1},
  pages        = {93--111},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1012337000887},
  doi          = {10.1023/A:1012337000887},
  timestamp    = {Thu, 22 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/BarriosMPR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/BiskupP01,
  author       = {Joachim Biskup and
                  Torsten Polle},
  title        = {Decomposition of object-oriented database schemas},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {2-4},
  pages        = {119--155},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1013134906161},
  doi          = {10.1023/A:1013134906161},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/BiskupP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/DekhtyarDDS01,
  author       = {Michael I. Dekhtyar and
                  Alexander Ja. Dikovsky and
                  Sergey M. Dudakov and
                  Nicolas Spyratos},
  title        = {Maximal state independent approximations to minimal real change},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {2-4},
  pages        = {157--204},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1013112907978},
  doi          = {10.1023/A:1013112907978},
  timestamp    = {Wed, 17 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/DekhtyarDDS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/EiterLW01,
  author       = {Thomas Eiter and
                  Thomas Lukasiewicz and
                  Michael Walter},
  title        = {A data model and algebra for probabilistic complex values},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {2-4},
  pages        = {205--252},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1013121110704},
  doi          = {10.1023/A:1013121110704},
  timestamp    = {Fri, 17 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/EiterLW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/GiunchigliaT01,
  author       = {Enrico Giunchiglia and
                  Armando Tacchella},
  title        = {A Subset-Matching Size-Bounded Cache for Testing Satisfiability in
                  Modal Logics},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {1},
  pages        = {39--67},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1012380814999},
  doi          = {10.1023/A:1012380814999},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/GiunchigliaT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Hartmann01,
  author       = {Sven Hartmann},
  title        = {On the implication problem for cardinality constraints and functional
                  dependencies},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {2-4},
  pages        = {253--307},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1013133428451},
  doi          = {10.1023/A:1013133428451},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Hartmann01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/LeontjevS01,
  author       = {Alexander Leontjev and
                  Vladimir Yu. Sazonov},
  title        = {{D:} Set-theoretic query language capturing {LOGSPACE}},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {2-4},
  pages        = {309--345},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1013189515673},
  doi          = {10.1023/A:1013189515673},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/LeontjevS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/MorrisK01,
  author       = {Robert A. Morris and
                  Lina Khatib},
  title        = {General Temporal Knowledge for Planning and Data Mining},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {1},
  pages        = {1--19},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1012361914091},
  doi          = {10.1023/A:1012361914091},
  timestamp    = {Tue, 24 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/MorrisK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Seipel01,
  author       = {Dietmar Seipel},
  title        = {Using clausal deductive databases for defining semantics in disjunctive
                  deductive databases},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {2-4},
  pages        = {347--378},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1013180132511},
  doi          = {10.1023/A:1013180132511},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Seipel01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Torres01,
  author       = {Jose Maria Turull Torres},
  title        = {A study of homogeneity in relational databases},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {2-4},
  pages        = {379--414},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1013132216581},
  doi          = {10.1023/A:1013132216581},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Torres01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/XuL01,
  author       = {Ke Xu and
                  Wei Li},
  title        = {An Average Analysis of Backtracking on Random Constraint Satisfaction
                  Problems},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {33},
  number       = {1},
  pages        = {21--37},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1012328830929},
  doi          = {10.1023/A:1012328830929},
  timestamp    = {Thu, 09 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/XuL01.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.