Sciweavers

351 search results - page 3 / 71
» Nominal Equational Logic
Sort
View
IJCAI
2003
13 years 6 months ago
Keys, Nominals, and Concrete Domains
Many description logics (DLs) combine knowledge tation on an abstract, logical level with an interface to “concrete” domains such as numbers and strings. We propose to extend ...
Carsten Lutz, Carlos Areces, Ian Horrocks, Ulrike ...
TLCA
2005
Springer
13 years 11 months ago
Avoiding Equivariance in Alpha-Prolog
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
Christian Urban, James Cheney
PPDP
2010
Springer
13 years 3 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
JAR
2010
95views more  JAR 2010»
13 years 9 days ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
JAPLL
2007
113views more  JAPLL 2007»
13 years 5 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