Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
We describe a new smart meeting room system called EasyMeeting that explores the use of FIPA agent technologies, Semantic Web ontologies, logic reasoning, and security and privacy...
Harry Chen, Filip Perich, Dipanjan Chakraborty, Ti...