Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Ontological Approaches For Semantic Interoperability, Michael A. Zang, Jens G. Pohl Sep 2003

Ontological Approaches For Semantic Interoperability, Michael A. Zang, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

This paper provides a basic description of the concept of an ontology. It then describes how ontologies are structured and employed in the context of interfaces between software based information systems. This usage is discussed in the context of three successive levels of semantic interoperability between two example systems. The paper goes on to suggest that the interfaces between information systems should perhaps be viewed and implemented as systems themselves. The paper concludes by providing a brief summary of what was discussed.


Computing Answer Sets Of A Logic Program Via-Enumeration Of Sat Certificates, Yuliya Lierler, Marco Maratea Jan 2003

Computing Answer Sets Of A Logic Program Via-Enumeration Of Sat Certificates, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

Answer set programming is a new programming paradigm proposed based on the answer set semantics of Prolog. It is well known that an answer set for a logic program is also a model of the program's completion. The converse is true when the logic program is "tight". Lin and Zhao showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called "loop formulas". Nevertheless, their solver ASSAT 1 has some disadvantages: it can work only with basic rules, and it can compute only one …