Sciweavers

2076 search results - page 172 / 416
» Functional logic overloading
Sort
View
TABLEAUX
2000
Springer
15 years 7 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
TLCA
2007
Springer
15 years 9 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
174
Voted
VLSID
2002
IEEE
207views VLSI» more  VLSID 2002»
16 years 3 months ago
Synthesis of High Performance Low Power Dynamic CMOS Circuits
This paper presents a novel approach for the synthesis of dynamic CMOS circuits using Domino and Nora styles. As these logic styles can implement only non-inverting logic, convent...
Debasis Samanta, Nishant Sinha, Ajit Pal
CSL
2006
Springer
15 years 7 months ago
Nonmonotonic Logics and Their Algebraic Foundations
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
Miroslaw Truszczynski
109
Voted
CADE
2005
Springer
16 years 3 months ago
Connecting Many-Sorted Theories
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
Franz Baader, Silvio Ghilardi