Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Propositional Defeasible Logic has Linear Complexity."

Michael J. Maher (2001)

> Home

Details and statistics

DOI: 10.1017/S1471068401001168

access: closed

type: Journal Article

metadata version: 2020-02-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tplp/Maher01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tplp/Maher01
Michael J. Maher:
Propositional Defeasible Logic has Linear Complexity. Theory Pract. Log. Program. 1(6): 691-711 (2001)

a service of

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.