Sciweavers

3983 search results - page 367 / 797
» Conceptual logic programs
Sort
View
GD
1994
Springer
15 years 10 months ago
A Geometrical Heuristic for Drawing Concept Lattices
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
Gerd Stumme, Rudolf Wille
PLDI
2004
ACM
16 years 3 days ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
CSL
2004
Springer
16 years 2 days ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 11 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
172
Voted
CIE
2005
Springer
16 years 6 days ago
A Logical Approach to Abstract Algebra
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
Thierry Coquand