Sciweavers

3047 search results - page 85 / 610
» On the Meaning of Logical Completeness
Sort
View
ENTCS
2007
99views more  ENTCS 2007»
14 years 9 months ago
Nominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
Ranald A. Clouston, Andrew M. Pitts
JAPLL
2007
113views more  JAPLL 2007»
14 years 9 months ago
Fresh Logic: proof-theory and semantics for FM and nominal techniques
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...
Murdoch Gabbay
DLOG
2010
14 years 7 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide
AAAI
2007
15 years 4 days ago
A Logical Theory of Coordination and Joint Ability
A team of agents is jointly able to achieve a goal if despite any incomplete knowledge they may have about the world or each other, they still know enough to be able to get to a g...
Hojjat Ghaderi, Hector J. Levesque, Yves Lesp&eacu...
LICS
1999
IEEE
15 years 2 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke