We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
For decades, researchers in knowledge representation (KR) have argued for and against various choices in KR formalisms, such as Rules, Frames, Semantic nets, and Formal logic. In ...
ended abstract provides an overview of my research towards a dissertation thesis in the context of programming cognitive agents with non-monotonic reasoning capabilities. Categori...