In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
e introducing the types and constants of the logic, i.e. its abstract syntax, and axioms describing the inference rules. As a tiny example, consider the following definition of min...
— The Semantic Web can be viewed as largely about “Knowledge meets the Web”. Thus its vision includes ontologies and rules. A key requirement for the architecture of the Sema...
Tassos Venetis, Giorgos Stoilos, Giorgos B. Stamou...