Sciweavers

1941 search results - page 43 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CSL
2006
Springer
15 years 10 months ago
Weak Bisimulation Approximants
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
Will Harwood, Faron Moller, Anton Setzer
LICS
2006
IEEE
16 years 7 days ago
Approximation Schemes for First-Order Definable Optimisation Problems
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...
LICS
2006
IEEE
16 years 7 days ago
Approximate Satisfiability and Equivalence
Eldar Fischer, Frédéric Magniez, Mic...
KR
2004
Springer
15 years 11 months ago
Towards a Structured Analysis of Approximate Problem Solving: A Case Study in Classification
Perry Groot, Annette ten Teije, Frank van Harmelen
146
Voted
KR
2000
Springer
15 years 9 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