Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

COCO
1997
Springer

81views Algorithms» more COCO 1997»

Complexity and Expressive Power of Logic Programming

15 years 7 months ago

Complexity and Expressive Power of Logic Programming

Download cs.roosevelt.edu

Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andre

Real-time Traffic

Algorithms | COCO 1997 |

claim paper

Related Content

» On the Expressive Power of Monadic Least Fixed Point Logic

» Expressiveness and complexity of graph logic

» On Expressive and Model Checking Power of Propositional Program Logics

» The Expressive Power of Structural Operational Semantics with Explicit Assumptions

» Complexity of Fractran and Productivity

» Linear Constraint Query Languages Expressive Power and Complexity

» EVOLP TranformationBased Semantics

» The Complexity of Model Checking HigherOrder Fixpoint Logic

» Some Results on the Expressive Power and Complexity of LSCs

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	COCO
Authors	Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov

Comments (0)