Sciweavers

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

11

ICLP
1992
Springer

favoriteEmaildiscussreport

86views Automated Reasoning» more ICLP 1992»

Complexity of Computing with Extended Propositional Logic Programs

13 years 8 months ago

Complexity of Computing with Extended Propositional Logic Programs

Download www.cs.uky.edu

V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszcz

Real-time Traffic

Automated Reasoning | ICLP 1992 |

claim paper

Related Content

» Translating propositional extended conjunctions of Horn clauses into Boolean circuits

» Reducing Propositional Theories in Equilibrium Logic to Logic Programs

» On the computational complexity of assumptionbased argumentation for default reasoning

» Propositional Dynamic Logic with Recursive Programs

» A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics

» Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Progr...

» On acyclic and headcycle free nested logic programs

» Maxx Test Pattern Optimisation with Local Search Over an Extended Logic

» Extending uncertainty formalisms to linear constraints and other complex formalisms

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	ICLP
Authors	V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski

Comments (0)