Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4185056

From MaRDI portal
Publication:5750422
Jump to:navigation, search

zbMATH Open0718.68065MaRDI QIDQ5750422FDOQ5750422

P. van Beek

Publication date: 1989



Title of this publication is not available (Why is that?)


zbMATH Keywords

approximation algorithmstemporal reasoninginterval logic complexity


Mathematics Subject Classification ID

Knowledge representation (68T30)



Cited In (11)

  • A generalized time quantifier approach to approximate reasoning
  • Efficient Temporal Satisfiability
  • From local to global consistency
  • Reasoning about qualitative temporal information
  • Temporal representation and reasoning in artificial intelligence: A review
  • On redundant topological constraints
  • Robust Approximation of Temporal CSP
  • The complexity of finding temporal separators under waiting time constraints
  • Parameterised temporal exploration problems
  • An initial study of time complexity in infinite-domain constraint satisfaction
  • An Algebraic Approach to Time-Span Reduction






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750422)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5750422&oldid=30522309"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 05:03. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki