Sciweavers

205 search results - page 28 / 41
» Higher-Order Coalition Logic
Sort
View
CSL
2007
Springer
14 years 4 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
CADE
2010
Springer
13 years 11 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
TFS
2010
130views Education» more  TFS 2010»
13 years 4 months ago
Toward General Type-2 Fuzzy Logic Systems Based on zSlices
Abstract--Higher order fuzzy logic systems (FLSs), such as interval type-2 FLSs, have been shown to be very well suited to deal with the high levels of uncertainties present in the...
Christian Wagner, Hani Hagras
TPHOL
2008
IEEE
14 years 4 months ago
A Brief Overview of HOL4
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...
Konrad Slind, Michael Norrish
PADL
2004
Springer
14 years 3 months ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...