Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 2207163 - MaRDI portal

scientific article; zbMATH DE number 2207163

From MaRDI portal
Publication:5693201

zbMath1099.68106MaRDI QIDQ5693201

No author found.

Publication date: 22 September 2005

Full work available at URL: http://www.sciencedirect.com/science/book/9780444514936

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

The problem of coincidence in a theory of temporal multiple recurrenceBack from the futureСистемы временной логики I: моменты, истории, деревьяA History of UntilThe token reification approach to temporal reasoningCompact and tractable automaton-based representations of time granularitiesTemporal Minimal-World Query Answering over Sparse ABoxesMetric dynamic equilibrium logicTense logic based on finite orthomodular posetsA faster algorithm for converting simple temporal networks with uncertainty into dispatchable formA two‐dimensional metric temporal logicMetric temporal answer set programming over timed tracesOntology-Mediated Query Answering with Data-Tractable Description LogicsEfficient Computation of Minimal Point Algebra Constraints by Metagraph ClosureUnnamed ItemAgent deliberation in an executable temporal frameworkIncremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn classFirst-order rewritability of ontology-mediated queries in linear temporal logicComputing the minimal relations in point-based qualitative temporal reasoning through metagraph closureApproximability of clausal constraintsDefinability and decidability of binary predicates for time granularityUniversal solutions for temporal data exchangeA Correspondence between Temporal Description LogicsComputing possible and certain answers over order-incomplete dataFirst-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated QueriesTemporal Contextual Logic ProgrammingCombining interval-based temporal reasoning with general TBoxes




This page was built for publication: