scientific article; zbMATH DE number 1882046
From MaRDI portal
Publication:4797422
zbMath1007.68174MaRDI QIDQ4797422
Publication date: 13 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2174/21740106.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Relation algebras of Sugihara, Belnap, Meyer, and Church ⋮ Branching interval algebra: an almost complete picture ⋮ Adding clauses to poor man's logic (without increasing the complexity) ⋮ Point algebras for temporal reasoning: Algorithms and complexity
This page was built for publication:
