Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....
Abstract-- In this paper we present the communication architecture of the DALI Logic Programming Agent-Oriented language and we discuss its semantics. We have designed a meta-level...
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...
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...