Sciweavers

1071 search results - page 6 / 215
» Programming with enumerable sets of structures
Sort
View
AAAI
2010
13 years 7 months ago
First-Order Indefinability of Answer Set Programs on Finite Structures
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
Yin Chen, Yan Zhang, Yi Zhou
MCU
2004
126views Hardware» more  MCU 2004»
13 years 8 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
ESWS
2005
Springer
14 years 29 days ago
Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
Patryk Burek, Rafal Grabos
ICSE
2008
IEEE-ACM
14 years 8 months ago
Using JULE to generate a compliance test suite for the UML standard
The Java-UML Lightweight Enumerator (JULE) tool implements a vitally important aspect of the framework for software tool certification - test suite generation. The framework uses ...
Panuchart Bunyakiati, Anthony Finkelstein, James S...