We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
: In this paper we consider a multiagent system with multiple ontologies. The agents maintain the ontologies individually which leads to frequent changes and possible knowledge inc...
Application or business logic, used in the development of services, has to do with the operations that define the application functionalities and not with the platform ones. Often...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...