Volume 5,
Number 1,
1992
Volume 5,
Number 2-4,
1992
- Chitta Baral, Jorge Lobo, Jack Minker:
Generalized Disjunctive Well-Founded Semantics for Logic Programs.
89-131 BibTeX
- Stephen V. Chenoweth, Henry W. Davis:
New Approaches for Understanding the Asymptotic Complexity of A Tree Searching.
133-162 BibTeX
- Jim Cox, Ken McAloon, Carol Tretkoff:
Computational Complexity and Constraint Logic Programming Languages.
163-189 BibTeX
- Henry W. Davis, Stephen V. Chenoweth:
The Mathematical Modeling of Heuristics.
191-227 BibTeX
- V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
A Theory of Nonmonotonic Rule Systems II.
229-263 BibTeX
- Brian G. Patrick, Mohammed Almulla, Monroe M. Newborn:
An Upper Bound on the Time Complexity of Iterative-Deepening-A.
265-277 BibTeX
- John S. Schlipf:
Formalizing a Logic for Logic Programming.
279-302 BibTeX
- Pascal Van Hentenryck, Thomas Graf:
Standard Forms for Rational Linear Arithmetic in Constraint Logic Programming.
303-319 BibTeX
- Larry Wos, William McCune:
The Application of Automated Reasoning to Questions in Mathematics and Logic.
321-369 BibTeX
Copyright © Sat May 16 23:50:14 2009
by Michael Ley (ley@uni-trier.de)