ABSTRACT
Designing and analyzing Semantic Web Services will become increasingly more difficult as the number of components increases and there are more calls to interfacing services. Not only will this increase complexity, but more logic conflicts and indeterminacy problems will occur. While the logic structures of OWL and RDFS will assist in controlling conflicts and uncertainties, such problems can not be completely excluded. To minimize and resolve these issues the design of Semantic Web Services should be subjected to logic methods and analysis that expose loops, conflicts and deadlocks. Graph theory offers important methods for addressing these issues since XML trees and RDF graphs will flow naturally toward graphical evaluation and resolution. In addition, First Order Logics have been successfully represented and evaluated as logic-oriented directed graphs for many years.
