@inproceedings{wermelinger95iccs,
title = {Conceptual Graphs and First-Order Logic},
author = {Michel Wermelinger},
booktitle = {Conceptual Structures: Applications, Implementation and Theory},
note = {Proc. of the 3rd Int'l Conf. on Conceptual Structures.},
pages = {323-337},
publisher = {Springer-Verlag},
series = {Lecture Notes in Artificial Intelligence},
url = {http://mcs.open.ac.uk/mw4687/pubs/1995/wermelinger95iccs.ps.gz},
volume = {954},
year = {1995},
abstract = {Conceptual Structures (CS) Theory is a logic-based knowledge representation
formalism. To show that conceptual graphs have the power of first-order
logic, it is necessary to have a mapping between both formalisms. A proof
system, i.e. axioms and inference rules, for conceptual graphs is also
useful. It must be sound (no false statement is derived from a true one)
and complete (all possible tautologies can be derived from the axioms).
This paper shows that Sowa's original definition of the mapping is
incomplete, incorrect, inconsistent, and unintuitive, and the proof system
is incomplete too. To overcome these problems a new translation algorithm
is given and a complete proof system is presented. Furthermore, the
framework is extended for higher-order types.},
pdf = {http://www.springerlink.com.libezproxy.open.ac.uk/content/774hp688576x4602/fulltext.pdf},
keywords = {conceptual_structures myown }
}
::