Sciweavers

3119 search results - page 328 / 624
» General Default Logic
Sort
View
TPHOL
1997
IEEE
15 years 11 months ago
Higher Order Quotients and their Implementation in Isabelle HOL
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence...
Oscar Slotosch
ICCAD
1994
IEEE
82views Hardware» more  ICCAD 1994»
15 years 10 months ago
A timing analysis algorithm for circuits with level-sensitive latches
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
Jin-fuw Lee, Donald T. Tang, C. K. Wong
ICLP
1990
Springer
15 years 10 months ago
Kernel Andorra Prolog and its Computation Model
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
Seif Haridi, Sverker Janson
VLDB
1990
ACM
69views Database» more  VLDB 1990»
15 years 10 months ago
Concept Description Language for Statistical Data Modeling
In this paper we describe a new language for statistical data modelling, which offers a general framework for the representation of elementary and summarydata.Thereare threemain c...
Tiziana Catarci, Giovanna D'Angiolini, Maurizio Le...
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
15 years 10 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz