Sciweavers

97 search results - page 6 / 20
» A 'Natural Logic' inference system using the Lambek calculus
Sort
View
WOLLIC
2007
Springer
14 years 1 months ago
A Formal Calculus for Informal Equality with Binding
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
Murdoch Gabbay, Aad Mathijssen
IS
2006
13 years 7 months ago
Composition of Semantic Web services using Linear Logic theorem proving
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
Jinghai Rao, Peep Küngas, Mihhail Matskin
AMAI
2004
Springer
13 years 7 months ago
Multi-Agent Systems Specification and Certification: A Situation and State Calculus Approach
We address the topic of specifying multi-agent systems using the situation and state calculus (SSC). SSC has been proposed as an extension of the situation calculus to overcome so...
Paula Gouveia, Jaime Ramos
LICS
2008
IEEE
14 years 1 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
BIRTHDAY
2004
Springer
14 years 23 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer