Sciweavers

4401 search results - page 432 / 881
» Computing with Default Logic
Sort
View
DAC
2003
ACM
16 years 7 months ago
The synthesis of cyclic combinational circuits
Combinational circuits are generally thought of as acyclic structures. It is known that cyclic structures can be combinational, and techniques have been proposed to analyze cyclic...
Marc D. Riedel, Jehoshua Bruck
CADE
2006
Springer
16 years 7 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...
ATAL
2000
Springer
15 years 11 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
KR
1998
Springer
15 years 11 months ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello
ENTCS
2007
108views more  ENTCS 2007»
15 years 6 months ago
Generating Java Compiler Optimizers Using Bidirectional CTL
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
Ling Fang, Masataka Sassa