P ≠ P - Why Some Reasoning Problems Are More Tractable Than Others.
Aus International Center for Computational Logic
P ≠ P - Why Some Reasoning Problems Are More Tractable Than Others.
Markus KrötzschMarkus Krötzsch
Markus Krötzsch
P ≠ P - Why Some Reasoning Problems Are More Tractable Than Others.
RR, 1-22, 2014
P ≠ P - Why Some Reasoning Problems Are More Tractable Than Others.
RR, 1-22, 2014
- Forschungsgruppe:Research Group: Information Systems„Information Systems“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Knowledge-Based Systems
@inproceedings{K2014,
author = {Markus Kr{\"{o}}tzsch},
title = {P {$\neq$} P - Why Some Reasoning Problems Are More Tractable
Than Others.},
booktitle = {RR},
year = {2014},
pages = {1-22}
}