Sciweavers

1391 search results - page 176 / 279
» Completeness of Neighbourhood Logic
Sort
View
ACL
1989
13 years 11 months ago
A Three-Valued Interpretation of Negation in Feature Structure Descriptions
Feature structures are informational elements that have been used in several linguistic theories and in computational systems for natural-language processing. A logicaJ calculus h...
Anuj Dawar, K. Vijay-Shanker
ACL
1990
13 years 11 months ago
Multiple Underlying Systems: Translating User Requests into Programs to Produce Answers
A user may typically need to combine the strengths of more than one system in order to perform a task. In this paper, we describe a component of the Janus natural language interfa...
Robert J. Bobrow, Philip Resnik, Ralph M. Weisched...
CADE
2010
Springer
13 years 10 months ago
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
Angelo Brillout, Daniel Kroening, Philipp Rüm...
ENTCS
2006
153views more  ENTCS 2006»
13 years 9 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
ENTCS
2006
101views more  ENTCS 2006»
13 years 9 months ago
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
Isar Stubbe