Skip to main content
SpringerLink
Log in
Book cover

Automated Practical Reasoning pp 1–5Cite as

Introduction

  • Chapter

  • 94 Accesses

Part of the book series: Texts and Monographs in Symbolic Computation ((TEXTSMONOGR))

Abstract

This book presents a collection of articles with topics linked to the working areas of a project named MEDLAR in which both the editors are actively involved. The authors of all the contributions are currently working or worked at the Research Institute for Symbolic Computation, Johannes Kepler University Linz (RISC-Linz).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • MEDLAR (1989/1992): Mechanizing deduction in the logics of practical reasoning. Technical Annex of ESPRIT BRA 3125, Department of Computing, Imperial College, University of London (also as Tech. Rep. RISC Linz 89-49.0); Technical Annex of ESPRIT BRP 6471, Department of Computing, Imperial College, University of London.

    Google Scholar 

  • MEDLAR (1990): Medlar milestone 1 deliverables (Proceedings of the 12-Month Workshop, Weinberg Castle, Austria, November 4–7, 1990). Department of Computing, Imperial College, University of London.

    Google Scholar 

  • MEDLAR (1991): Proceedings of the 24-Month Medlar Workshop (Grenoble, France, December 8–11, 1991). Department of Computing, Imperial College, University of London.

    Google Scholar 

  • MEDLAR (1993a): Medlar final progress report. Department of Computing, Imperial College, University of London.

    Google Scholar 

  • MEDLAR (1993b): Medlar II report PPR1 (Proceedings of the 12-Month Workshop, Leeds, UK, July 4–7, 1993). Department of Computing, Imperial College, University of London.

    Google Scholar 

  • Gabbay, D. (1990): Labelled deductive systems, part I. CIS, University of Munich, CIS-Bericht 90-22.

    Google Scholar 

  • Pfalzgraf, J. (1991): Logical fiberings and polycontextural systems. In: Jorrand, P., Kelemen, J. (eds.): Fundamentals of artificial intelligence research. Springer, Berlin Heidelberg New York Tokyo, pp. 170–184 (Lecture notes in computer science, vol. 535).

    Chapter  Google Scholar 

  • Pfalzgraf, J. (1993): On mathematical modeling in robotics. In: Calmet, J., Campbell, J. A. (eds.): Artificial intelligence and symbolic mathematical computing. Springer, Berlin Heidelberg New York Tokyo, pp. 116–132 (Lecture notes in computer science, vol. 737).

    Chapter  Google Scholar 

  • Pfalzgraf, J. (1995): On geometric and topological reasoning in robotics. Ann. Math. Artif. Intell. (to appear).

    Google Scholar 

  • Pfalzgraf, J., Stokkermans, K. (1993): Scenario construction continued and extended with a view to test and enhancement of reasoning methods. Tech. Rep. RISC Linz 92-27 [also in: MEDLAR (1993a): Medlar final progress report. Department of Computing, Imperial College, University of London].

    Google Scholar 

  • Pfalzgraf, J., Stokkermans, K., Wang, D. M. (1990): The robotics benchmark. In: MEDLAR (1990): Medlar milestone 1 deliverables. Department of Computing, Imperial College, University of London.

    Google Scholar 

  • Pfalzgraf, J., Sigmund, U., Stokkermans, K. (1993): Comparison of two approaches to modeling robotics scenarios. Tech. Rep. RISC Linz 93-56.

    Google Scholar 

  • Schicho, J. (1992): On the choice of pencils in the parametrization of curves. J. Symb. Comput. 14: 557–576.

    MathSciNet  MATH  Google Scholar 

  • Schicho, J. (1994): An algorithm for the parametrization of rational surfaces. Ph.D. thesis, University of Linz, Linz, Austria.

    Google Scholar 

  • Stokkermans, K. (1991): A categorical approach to critical-pair/completion procedures. Tech. Rep. RISC Linz 91-58.

    Google Scholar 

  • Stokkermans, K. (1993): A categorical formulation for critical-pair/completion procedures. In: Rusinowitch, M., Rémy, J.-L. (eds.): Conditional term rewriting systems. Springer, Berlin Heidelberg New York Tokyo, pp. 328–342 (Lecture notes in computer science, vol. 656).

    Chapter  Google Scholar 

  • Wang, D. M. (1991): Reasoning about geometric problems using algebraic methods. Tech. Rep. RISC Linz 91-51.0 [also in MEDLAR (1991): Proceedings of the 24-Month Medlar Workshop. Department of Computing, Imperial College, University of London].

    Google Scholar 

  • Wang, D. M. (1992a): On the parallelization of characteristic-set-based algorithms. In: Zima, H. P. (ed.): Parallel computation. Springer, Berlin Heidelberg New York Tokyo, pp. 338–349 (Lecture notes in computer science, vol. 591).

    Chapter  Google Scholar 

  • Wang, D. M. (1992b): Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases. Comput. Aided Geom. Des. 9: 471–484.

    Article  MATH  Google Scholar 

  • Wang, D. M. (1992c): Some improvements on Wu’s method for solving systems of algebraic equations. In: Wu, W.-T., Cheng, M.-D. (eds.): Proceedings of the International Workshop on Mathematics Mechanization, Beijing, China, July 16–18, 1992, pp. 89–100.

    Google Scholar 

  • Wang, D. M. (1992d): A strategy for speeding-up the computation of characteristic sets. In: Havel, I. M., Koubek, V. (eds.): Mathematical foundations of computer science. Springer, Berlin Heidelberg New York Tokyo, pp. 504–510 (Lecture notes in computer sciences, vol. 629).

    Chapter  Google Scholar 

  • Wang, D. M. (1993a): An elimination method based on Seidenberg’s theory and its applications. In: Eyssette, F., Galligo, A. (eds.): Computational algebraic geometry. Progr. Math. 109: 301–328.

    Google Scholar 

  • Wang, D. M. (1993b): Geometry theorem proving with existing technology. Tech. Rep. RISC Linz 93-40 [also in: MEDLAR (1993b): Medlar II report PPR1. Department of Computing, Imperial College, University of London].

    Google Scholar 

  • Wang, D. M. (1993c): An elimination method for polynomial systems. J. Symb. Comput. 16: 83–114.

    Article  MATH  Google Scholar 

  • Wang, D. M. (1993d): Solving polynomial equations: characteristic sets and triangular systems. In: Jacob, G., Oussous, N. E., Steinberg, S. (eds.): Proceedings of the International IMACS Symposium on Symbolic Computation, Lille, France, June 14–17, 1993, pp. 3–9.

    Google Scholar 

Download references

Authors
  1. Jochen Pfalzgraf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dongming Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute for Symbolic Computation, Johannes-Kepler-University Linz, Linz, Austria

    Jochen Pfalzgraf

  2. Laboratoire d’Informatique Fondamentale et d’Intelligence Artificielle, Institut National Polytechnique de Grenoble, Grenoble, France

    Dongming Wang

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Wien

About this chapter

Cite this chapter

Pfalzgraf, J., Wang, D. (1995). Introduction. In: Pfalzgraf, J., Wang, D. (eds) Automated Practical Reasoning. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6604-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6604-8_1

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82600-3

  • Online ISBN: 978-3-7091-6604-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation