Sciweavers

54 search results - page 5 / 11
» Some properties of the disjunctive languages contained in Q
Sort
View
103
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 4 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
SIROCCO
2010
14 years 11 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
FLAIRS
2007
14 years 12 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
ECAI
1992
Springer
15 years 1 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
14 years 9 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...