See this document in CiteSeerX!

Computer Support for the Development and Investigation of Logics (1994)  (Make Corrections)  (1 citation)
Hans Jürgen Ohlbach



  Home/Search   Context   Related

 
View or download:
mpisb.mpg.de/pub/...MPII94228.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  indiana.edu/pub/ucstri/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Symbolic reasoning in a logical framework becomes more and more important for computer applications such as Natural Language Processing Systems or Expert Systems. These applications usually need specifically tailored logics. Therefore we are developing methods and algorithms for supporting the designer of an application system, who is usually not a logician, to develop his own application oriented logic. This paper gives an overview about our current state of these investigations. In... (Update)

Similar documents based on text:   More   All
0.4:   Elimination of Self-Resolving Clauses - Ohlbach (1998)   (Correct)
0.4:   Journal of the IGPL - Volume Number February   (Correct)
0.3:   Killer Transformations - Hans Jürgen Ohlbach, Dov Gabbay.. (1994)   (Correct)

BibTeX entry:   (Update)

H. J. Ohlbach (1991), Computer support for the development and investigation of logics. J. of the IGPL 4,1, pp 109-127. http://citeseer.ist.psu.edu/ohlbach94computer.html   More

@techreport{ ohlbach94computer,
    author = "Hans J{\"u}rgen Ohlbach",
    title = "Computer Support for the Development and Investigation of Logics",
    number = "MPI-I-94-228",
    address = "Saarbr{\"u}cken, Germany",
    pages = "24",
    year = "1994",
    url = "citeseer.ist.psu.edu/ohlbach94computer.html" }
Citations (may not include all citations):
343   Modal Logic: An Introduction (context) - Chellas - 1980
80   Argonne National Laboratory (context) - McCune, Guide et al. - 1989
74   Correspondence theory (context) - van Benthem - 1984
59   On restrictions of ordered paramodulation with simplificatio.. (context) - Bachmair, Ganzinger - 1990
58   Solvable Cases of the Decision Problem (context) - Ackermann - 1954
52   Quantifier elimination in second--order predicate logic - Gabbay, Ohlbach - 1992
42   A completeness theorem in modal logic (context) - Kripke - 1959
42   Modal theorem proving: An equational viewpoint (context) - Auffray, Enjalbert - 1992
37   Proving theorems with the modification method (context) - Brand - 1975
30   Zeitschrift fur mathematische Logik und Grundlagen der Mathe.. (context) - Kripke, of et al. - 1963
27   Experiments in automated deduction with condensed detachment (context) - McCune, Wos - 1992
24   Raisonnement automatique en logique modale et algorithmes d'.. (context) - Herzig - 1989
22   Transactions of American Mathematical Society (context) - Stone, of et al. - 1936
21   Matrix proof methods for modal logics (context) - Wallen - 1987
21   First-order modal logic theorem proving and functional simul.. (context) - Nonnengart - 1993

[Article contains additional citations not shown here]

Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index):   More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998)   (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992)   (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC