Reasoning in Attempto Controlled English

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2901, Issue , 2003, Pages 174-188

  Fuchs, Norbert E ^a   Schwertel, Uta ^a  

^a UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTIC WEB;

ATTEMPTO CONTROLLED ENGLISH; AUTOMATIC REASONING; CONSISTENCY CHECKING; FIRST ORDER LOGIC; KNOWLEDGE REPRESENTATION LANGUAGE; LOGICAL CONSEQUENCES; MODEL GENERATOR; PROOF PROCEDURES;

KNOWLEDGE REPRESENTATION;

EID: 0346895360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24572-8_12     Document Type: Article

References (23)

1. AP: Lean, Tableau-Based Deduction. Journal of Automated Reasoning, 15(3):339-358, 1995.
2. P. Blackburn and J. Bos. Computational Semantics. Theoria, 18(1):27-45, 2003.
3. J. Bos. Model Building for Natural Language Understanding, ms., 2001. Draft at www.iccs.informatics.ed.ac.uk/∼jbos.
4. F. Bry and S. Torge. A Deduction Method Complete for Refutation and Finite Satisfiability. In Proc. 6th European Workshop on Logics in Artificial Intelligence, volume 1489 of Lecture Notes in Artificial Intelligence. Springer, 1998.
5. F. Bry and A. H. Yahya. Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation. Journal of Automated Reasoning, 25(1):35-82, 2000.
6. N. E. Fuchs. Specifications Are (Preferably) Executable. Software Engineering Journal, 7(5):323-334, 1992.
7. Reprinted in: J. P. Bowen, M. G. Hinchey, High-Integrity System Specification and Design, Springer-Verlag London, 1999.
8. L. F. He. UNSATCHMO: Unsatisfiability Checking by Model Rejection. In R. Goré, A. Leitsch, and T. Nipkov, editors, International Joint Conference on Automated Reasoning IJCAR 2001, Short Papers, pages 64-75, Siena, Italy, 2001.
9. J. R. Hobbs. Ontological Promiscuity. In 23rd Annual Meeting of the ACL, pages 61-69, University of Chicago, Illinois, 1985.
10. L. M. Iwanska and S. C. Shapiro, editors. Natural Language Processing and Knowledge Representation. AAAI Press/MIT Press, Menlo Park, CA, 2000.
11. H. Kamp and U. Reyle. From Discourse to Logic. Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory. Kluwer, Dordrecht, 1993.
12. G. Link. The Logical Analysis of Plurals and Mass Terms: A Lattice-Theoretical Approach. In R. Bäuerle, C. Schwarze, and A. von Stechow, editors, Meaning, Use, and Interpretation of Language, pages 302-323. de Gruyter, Berlin, 1983.
13. R. Manthey and F. Bry. SATCHMO: A Theorem Prover Implemented in Prolog. In E. L. Lusk and R. A. Overbeek, editors, Proc. CADE 88, Ninth International Conference on Automated Deduction, volume 310 of Lecture Notes in Computer Science, pages 415-434. Springer, Argonne, Illinois, 1988.
14. W. W. McCune. Otter 3.0 Reference Manual and Guide. Technical Report ANL-94/6, Argonne National Laboratory, 1994.
15. W. W. McCune. Mace 2.0 Reference Manual and Guide. Technical Memorandum ANL/MCS-TM-249, Argonne National Laboratory, 2001.
16. U. Reyle and D. M. Gabbay. Direct Deductive Computation on Discourse Representation Structures. Linguistics and Philosophy, 17:343-390, 1994.
17. H. Schütz and T. Geisler. Efficient Model Generation through Compilation. Information and Computation, 162(1-2):138-157, 2000.
18. U. Schwertel. Controlling Plural Ambiguities in Attempto Controlled English. In 3rd International Workshop on Controlled Language Applications (CLAW), Seattle, Washington, 2000.
19. J. F. Sowa. Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks Cole Publishing Co., Pacific Grove, CA, 2000.
20. M. E. Stickel. Schubert's Steamroller Problem: Formulation and Solutions. Journal of Automated Reasoning, 2(1):89-101, 1986.
21. J. Sukkarieh. Quasi-NL Knowledge Representation for Structurally-Based Inferences. In 3rd Workshop on Inference in Computational (ICoS-3), Siena, Italy, 2001a.
22. G. Suttcliffe and C. Suttner. Results of the CADE-13 ATP System Competition. Journal Automated Reasoning, 18(2):259-264, 1997.
23. S. Torge. Überprüfung der Erfüllbarkeit im Endlichen: Ein Verfahren und seine Anwendung. Ph.D. thesis, University of Munich, 1998.