"Complexity of Computing with Extended Propositional Logic Programs."

V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski (1992)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2013-12-02

- no documents available
- export record
  dblp key:
  - conf/iclp/MarekRT92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclp/MarekRT92
V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski:
Complexity of Computing with Extended Propositional Logic Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 93-102

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.