Conceptual graphs and first order logic

Computer Journal

Volumn 43, Issue 1, 2000, Pages 1-12

  Amati, Gianni ^a,b   Ounis, Iadh ^b  

^a FONDAZIONE UGO BORDONI   (Italy)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; GRAPH THEORY; PROLOG (PROGRAMMING LANGUAGE); THEOREM PROVING;

CONCEPTUAL GRAPHS; FIRST ORDER LOGIC (FOL);

KNOWLEDGE REPRESENTATION;

EID: 0034482891     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/43.1.1     Document Type: Article

References (27)

1. Sowa, J. F. (1984) Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley Publishing Company, Reading, MA.
2. Gaines, B. R. (1993) Representation, discourse, logic and truth: situating knowledge technology. In Mineau, G., Moulin, W. and Sowa, J. F. (eds), Proc. 1st Int. Conf. on Conceptual Structures, ICCS'93 (Lecture Notes in Artificial Intelligence, vol. 699), Quebec, Canada, pp. 36-63. Springer-Verlag.
3. Mineau, G. W., Moulin, B. and Sowa, J. F. (eds) (1993) Proc. 1st Int. Conf. on Conceptual Structures, ICCS'93 (Lecture Notes in Artificial Intelligence, vol. 699), Quebec, Canada. Springer-Verlag.
4. Tepfenhart, W. M., Dick, J. P. and Sowa, J. F. (eds) (1994) Conceptual Structures: Current Practices. Proc. 2nd Int. Conf. on Conceptual Structures, ICCS'94 (Lecture Notes in Artificial Intelligence, vol. 835), College Park, USA. Springer-Verlag.
5. Ellis, G., Levinson, R., Rich, W. and Sowa, J. F. (eds) (1995) 3rd Int. Conf. on Conceptual Structures, ICCS'95 (Lecture Notes in Artificial Intelligence, vol. 954), Santa Cruz, CA. Springer-Verlag.
6. Eklund, P. W., Ellis, G. and Mann, G. (eds) (1996) 4th Int. Conf. on Conceptual Structures, ICCS'96 (Lecture Notes in Artificial Intelligence, vol. 1115), Sydney, Australia. Springer-Verlag.
7. Chein, M. and Mugnier, M. L. (1995) Conceptual Graphs are also Graphs. Research report 95-004, LIRMM.
8. Chein, M. and Mugnier, M. L. (1992) Conceptual graphs: fundamental notions. Revue d'Intelligence Artificielle, 6, 365-406.
9. Ghosh, B. C. and Wuwongse, V. (1995) A direct proof procedure for definite conceptual graphs programs. In Ellis et al. [5], pp. 158-172.
10. Wermelinger, M. (1995) Conceptual graphs and first-order logic. In Ellis et al. [5], pp. 323-337.
11. Prediger, S. (1998) Simple concept graphs: a logic approach. In Mugnier, M. L. and Chein, M. (eds), Proc. 6th Int. Conf. on Conceptual Structures (Lecture Notes in Artificial Intelligence), Montpellier, France, pp. 225-239. Springer-Verlag.
12. Salvat, E. and Mugnier, M. L. (1996) Sound and complete forward and backward chainings of graph rules. In Eklund, P. W., Ellis, G. and Mann, G. (eds), Proc. 4th Int. Conf. Conceptual Structures, ICCS'96 (Lecture Notes in Artificial Intelligence, vol. 1115), Sydney, Australia, pp. 248-262. Springer-Verlag.
13. Mugnier, M. L. (1995) On generalization-specialization for conceptual graphs. J. Exp. Theor. Artif. Intell., 7, 325-344.
14. Chang, C. C. and Keisler, H. J. (1990) Model Theory (3rd edn). North-Holland Publishing Co., Amsterdam.
15. Mendelson, E. (1987) Introduction to Mathematical Logic. Wadsworth & Brooks, Monterey, California.
16. Cao, T. H. and Creasy, P. N. (1997) Universal marker and functional relation: semantics and operations. In Delugach, H. S., Lukose, D., Keeler, M., Searle, M. L. and Sowa, J. F. (eds), 5th Int. Conf. on Conceptual Structures, ICCS'97 (Lecture Notes in Artificial Intelligence, Subseries of Lecture Notes in Computer Science, vol. 1257), Seattle, WA, pp. 416-430. Springer-Verlag.
17. Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. (1997) Complexity and expressive power of logic programming. In Proc. 12th Ann. IEEE Conf. on Computational Complexity (CCC'97), Ulm, Germany.
18. Jones, N. and Laaser, W. (1977) Complete problems in deterministic polynomial time. Theor. Comput. Sci., 3, 105-1177.
19. Vardi, M. (1982) Complexity of relational query languages. In Proc. 14th STOC Conf., San Francisco, pp. 137-146.
20. Immerman, N. (1986) Relational queries computable in polynomial time. Inf. Control, 68, 86-104.
21. Sowa, J. F. (1999) Knowledge Representation, Logical, Philosophical, and Computational Foundations. Cole Publishers, Pacific Grove, CA.
22. Lloyd, J. W. (1987) Foundations of Logic Programming (2nd edn). Springer-Verlag, Berlin.
23. Robinson, J. A. (1965) A machine-oriented logic based on the resolution principle. J. Assoc. Comput. Mach., 12, 23-41.
24. Chang, C. L. and Lee, R. C. T. (1973) Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York.
25. Lenzerini, M. (1990) Class hierarchies and their complexity. In Banchilhon, F. and Boolemann, P. (eds), Advances in Databases Programming Languages. ACM Press, New York.
26. Lenzerini, M. (1991) Careful closure of inheritance networks. In Lenzerini, M., Nardi, D. and Simi, M. (eds), Inheritance Hierarchies in Knowledge Representation and Programming Languages, pp. 97-112. John Wiley & Sons, Chichester, UK.
27. Ounis, I. and Pasca, M. (1998) RELIEF: Combining expressiveness and rapidity into a single system. In The ACM SIGIR'98 Conf., Melbourne, Australia, pp. 266-274.