Annals of Mathematics and Artificial Intelligence, Volume 17

Volume 17, Numbers 1-2, 1996

Reasoning about Functional Models

Elizabeth Bradley, Reinhard Stolle: Automatic Construction of Accurate Models of Physical Systems. 1-28 BibTeX
George M. Lady: Detecting Stable Matrices. 29-36 BibTeX
Harvey J. Greenberg: Consistency, Redundancy, and Implied Equalities in Linear Systems. 37-83 BibTeX
Jean-Louis Imbert, Pascal Van Hentenryck: Redundancy Elimination with a Lexicographic Solved Form. 85-106 BibTeX
Mark Parker, Jennifer Ryan: Finding the Minimum Weight IIS Cover of an Infeasible System of Linear Inequalities. 107-126 BibTeX
John W. Chinneck: An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem. 127-144 BibTeX
Saied Ghannadan, Stein W. Wallace: Feasibility in Capacitated Networks: The Effect of Individual Arcs and Nodes. 145-153 BibTeX
Alexander B. Bordetsky: Reasoning on Infeasibility in Distributed Collaborative Computing Environment. 155-176 BibTeX

Ganesh Baliga, Anil M. Shende: Learning-Theoretic Perspectives of Acceptable Numberings. 177-187 BibTeX
Jennifer Burg, Sheau-Dong Lang, Charles E. Hughes: Intelligent Backtracking in CLP(R). 189-211 BibTeX
Pawel Cholewinski: Seminormal Stratified Default Theories. 213-234 BibTeX
Fausto Giunchiglia, Paolo Traverso: Program Tactics and Logic Tactics. 235-259 BibTeX
Luigi Palopoli, Carlo Zaniolo: Polynomial-Time Computable Stable Models. 261-290 BibTeX
John-Jules Ch. Meyer, Wiebe van der Hoek: A Modal Contrastive Logic: The Logic of `but'. 291-313 BibTeX
Ruchir Puri, Jun Gu: A BDD SAT Solver for Satisfiability Testing: An Industrial Case Study. 315-337 BibTeX
Daniele Pretolani: Hierarchies of Polynomially Solvable Satisfiability Problems. 339-357 BibTeX
Jinchang Wang, Evangelos Triantaphyllou: A Cost Effective Question-Asking Strategy for Horn Clause Systems. 359-379 BibTeX
Max Böhm, Ewald Speckenmeyer: A Fast Parallel SAT-Solver - Efficient Workload Balancing. 381-400 BibTeX