Sciweavers

446 search results - page 27 / 90
» Abstract Interpretation Using Typed Decision Graphs
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
ICCS
2004
Springer
14 years 27 days ago
KNAML: A Knowledge Representation Language for Distributed Reasoning
The Knowledge Agent Mediation Language (KNAML) is designed for use in multi-agent reasoning systems. Like conceptual graphs, KNAML represents knowledge using concepts, relations, a...
Gordon Streeter, Andrew Potter
ICFP
2009
ACM
14 years 8 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
ATVA
2004
Springer
115views Hardware» more  ATVA 2004»
13 years 11 months ago
First-Order LTL Model Checking Using MDGs
In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, LMDG ...
Fang Wang, Sofiène Tahar, Otmane Aït M...
SODA
2003
ACM
81views Algorithms» more  SODA 2003»
13 years 9 months ago
Smaller explicit superconcentrators
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...
Noga Alon, Michael R. Capalbo