Basic theory of feature trees

From MaRDI portal

Revision as of 20:45, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5277702

Jump to:navigation, search

DOI10.1145/1013560.1013561zbMath1367.68112OpenAlexW2125226703MaRDI QIDQ5277702

Pawel Mielniczuk

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1013560.1013561

zbMATH Keywords

complexity decision algorithm feature tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (1)

Decidable first-order transition logics for PA-processes

This page was built for publication: Basic theory of feature trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5277702&oldid=19921515"