Sciweavers

174 search results - page 11 / 35
» Existential Fixed-Point Logic
Sort
View
TLCA
2009
Springer
15 years 4 months ago
On the Values of Reducibility Candidates
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
Colin Riba
DLT
2009
14 years 7 months ago
Subshifts, Languages and Logic
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
Emmanuel Jeandel, Guillaume Theyssier
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
15 years 4 months ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
ICFP
2003
ACM
15 years 10 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
KR
2010
Springer
15 years 2 months ago
Walking the Decidability Line for Rules with Existential Variables
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
Jean-François Baget, Michel LeClere, Marie-...