Pitts and Stark have proposed the ν-calculus as a language for investigating the interaction of unique name generation and higherorder functions. They developed a sound model based on logical relations, but left completeness as an open problem. In this paper, we develop a complete model based on bisimulation for a labelled transition system semantics. We show that bisimulation is complete, but ...

Most common sense reasoning formalisms do not account for the passage of time as the reasoning occurs, and hence are inadequate from the point of view of modeling an agent's ongoing process of reasoning. We present a modal active-logic that treats time as a valuable resource that is consumed in each step of the agent's reasoning. We provide a sound and complete characterization for this logic a...

We investigate subsumption algorithms for logic-based knowledge representation languages of the kl-one family. We deene an attribu-tive concept description language that contains the logical connectives conjunction, disjunction, and negation, as well as role quantiication, number restrictions and role intersection. We describe a rule based calculus to decide subsumption in this language, that c...

We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlying the prover concern resource management and focused derivations, both of which are traditionally understood in the domain of backward reasoning systems such as logic programming. We illustrate how resource management...

Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that correspond semantically to each other. We present an approach to deal with the lack of background knowledge in matching tasks by using semantic matching iteratively. Unlike previous approaches, where the missing axioms are m...

We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classiied graph is represented by a deenite clause that possesses variables of the sort node for representing nodes and atoms for representing the edges. In contrast to the standard logical semantics, different node variables are assumed to denote diierent...

logical form or covert syntax is a syntactic level introduced in recent generative approaches. using the ideas of first-order predicate logic, it interprets the strings whose elements cannot move in s–structure, because an element moves if it does not acquire its necessary scope. but unlike the predicate logic, logical form is based on syntactic principles and rules. therefore, logical form is ...

An extension of predicate logic, called Transaction Logic, is proposed, which accounts in a clean and declarative fashion for the phenomenon of state changes in logic programs and databases. Transaction Logic has a natural model theory and a sound and complete proof theory, but unlike many other logics, it allows users to program transactions. The semantics leads naturally to features whose ama...