7106 search results - page 34 / 1422 » Restricted Complexity, General Complexity |
DNA
2011
Springer
12 years 7 months ago
2011
Springer
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
IJCAI
2007
13 years 9 months ago
2007
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional ab...
ACL
2010
13 years 5 months ago
2010
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...