Sciweavers

2905 search results - page 165 / 581
» Formal Memetic Algorithms
Sort
View
FMSD
2002
114views more  FMSD 2002»
15 years 17 days ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa
TASE
2012
IEEE
13 years 8 months ago
Discrete-Event Coordination Design for Distributed Agents
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
Manh Tung Pham, Kiam Tian Seow
99
Voted
CAV
2009
Springer
157views Hardware» more  CAV 2009»
16 years 1 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
PADL
2010
Springer
15 years 9 months ago
Implementing Query Answering for Hybrid MKNF Knowledge Bases
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
Ana Sofia Gomes, José Júlio Alferes,...
111
Voted
ACL2
2006
ACM
15 years 6 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber