Sciweavers

10568 search results - page 74 / 2114
» Computer Intelligence and Formalization
Sort
View
TACAS
1997
Springer
132views Algorithms» more  TACAS 1997»
15 years 1 months ago
Test Generation for Intelligent Networks Using Model Checking
We study the use of model checking techniques for the generation of test sequences. Given a formal model of the system to be tested, one can formulate test purposes. A model checke...
André Engels, Loe M. G. Feijs, Sjouke Mauw
AI
2010
Springer
14 years 10 months ago
Updating action domain descriptions
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
DAC
2001
ACM
15 years 10 months ago
Formal Property Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines
roperty Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines Dong Wang , Pei-Hsin Ho , Jiang Long , James Kukula Yunshan Zhu , Tony Ma , Robert D...
Dong Wang, Pei-Hsin Ho, Jiang Long, James H. Kukul...
ATAL
2010
Springer
14 years 11 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
AAAI
1994
14 years 11 months ago
Rule Based Updates on Simple Knowledge Bases
In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update spe...
Chitta Baral