Sciweavers

395 search results - page 70 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 11 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
AAAI
2006
13 years 11 months ago
From Pigeons to Humans: Grounding Relational Learning in Concrete Examples
We present a cognitive model that bridges work in analogy and category learning. The model, Building Relations through Instance Driven Gradient Error Shifting (BRIDGES), extends A...
Marc T. Tomlinson, Bradley C. Love
JANCL
2008
170views more  JANCL 2008»
13 years 9 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 9 months ago
A Logic-Based Approach to Combinatorial Testing with Constraints
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
Andrea Calvagna, Angelo Gargantini
FUIN
2000
109views more  FUIN 2000»
13 years 9 months ago
Building Knowledge Scouts Using KGL Metalanguage
Knowledge scouts are software agents that autonomously search for and synthesize user-oriented knowledge (target knowledge) in large local or distributed databases. A knowledge ge...
Ryszard S. Michalski, Kenneth A. Kaufman