Sciweavers

3440 search results - page 267 / 688
» Logics For Context-Free Languages
Sort
View
IGPL
2008
67views more  IGPL 2008»
15 years 7 months ago
Complete Axiomatisations of Properties of Finite Sets
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
Thomas Ågotnes, Michal Walicki
COLING
2002
15 years 7 months ago
Computation of Modifier Scope in NP by a Language-neutral Method
The relative logical scope of multiple modifiers within NP is often semantically significant. This paper proposes a structurally based method for computing the relative scope of s...
Richard Campbell
JSYML
2000
69views more  JSYML 2000»
15 years 7 months ago
Topological Elementary Equivalence of Closed Semi-Algebraic Sets in The Real Plane
We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche
DLOG
2009
15 years 5 months ago
Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles
Abstract. We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus i...
Mark Kaminski, Gert Smolka
ICFP
2009
ACM
16 years 8 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...