Sciweavers

2152 search results - page 331 / 431
» On Automating the Calculus of Relations
Sort
View
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 4 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
99
Voted
KR
2000
Springer
15 years 4 months ago
Significant Inferences : Preliminary Report
We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
Philippe Besnard, Torsten Schaub
KR
2000
Springer
15 years 4 months ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy
145
Voted
KR
1991
Springer
15 years 4 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
106
Voted
LICS
1991
IEEE
15 years 4 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002