265 search results - page 27 / 53 » Weakly Algebraizable Logics |
EUSFLAT
2003
13 years 10 months ago
2003
We report on experiments designed to highlight the strengths and weaknesses of an autonomous rule acquisition algorithm for the fuzzy controller of a simulated mobile robot. The a...
ACL
1997
13 years 10 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...