Sciweavers

28 search results - page 1 / 6
» Knowledge Compilation Properties of Tree-of-BDDs
Sort
View
AAAI
2007
13 years 7 months ago
Knowledge Compilation Properties of Tree-of-BDDs
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
Sathiamoorthy Subbarayan, Lucas Bordeaux, Youssef ...
IJCAI
2003
13 years 6 months ago
A Theory of Average-Case Compilability in Knowledge Representation
Compilability is a fundamental property of knowledge representation formalisms which captures how succinctly information can be expressed. Although many results concerning compila...
Hubie Chen
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
12 years 11 months ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson
DFKI
2005
Springer
13 years 6 months ago
Multiagent Systems Without Agents - Mirror-Holons for the Compilation and Enactment of Communication Structures
It is widely accepted in Distributed Artificial Intelligence that a crucial property of artificial agents is their autonomy. Whereas agent autonomy enables features of agent-base...
Matthias Nickles, Gerhard Weiß
ISSTA
2004
ACM
13 years 10 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick