Sciweavers

4573 search results - page 823 / 915
» Automated Reasoning
Sort
View
LACL
2005
Springer
15 years 5 months ago
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
Peter Ljunglöf
LPAR
2005
Springer
15 years 5 months ago
Concepts of Automata Construction from LTL
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
Carsten Fritz
LPAR
2005
Springer
15 years 5 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang
LPNMR
2005
Springer
15 years 5 months ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
PPSWR
2005
Springer
15 years 5 months ago
Marriages of Convenience: Triples and Graphs, RDF and XML in Web Querying
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...
Tim Furche, François Bry, Oliver Bolzer