[图书][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Logics for unranked trees: An overview
L Libkin - Logical Methods in Computer Science, 2006 - lmcs.episciences.org
Labeled unranked trees are used as a model of XML documents, and logical languages for
them have been studied actively over the past several years. Such logics have different …
them have been studied actively over the past several years. Such logics have different …
Temporal representation and reasoning
M Fisher - Foundations of Artificial Intelligence, 2008 - Elsevier
Publisher Summary This chapter presents many ways in which temporal phenomena can be
modeled, described, reasoned about, and applied. The chapter describes the use of …
modeled, described, reasoned about, and applied. The chapter describes the use of …
Probabilistic polynomial-time semantics for a protocol security logic
We describe a cryptographically sound formal logic for proving protocol security properties
without explicitly reasoning about probability, asymptotic complexity, or the actions of a …
without explicitly reasoning about probability, asymptotic complexity, or the actions of a …
[PDF][PDF] A cyclic proof system for full computation tree logic
B Afshari, GE Leigh… - 31st EACSL Annual …, 2023 - drops.dagstuhl.de
Abstract Full Computation Tree Logic, commonly denoted CTL*, is the extension of Linear
Temporal Logic LTL by path quantification for reasoning about branching time. In contrast to …
Temporal Logic LTL by path quantification for reasoning about branching time. In contrast to …
Quantified CTL: expressiveness and complexity
F Laroussinie, N Markey - Logical Methods in Computer …, 2014 - lmcs.episciences.org
While it was defined long ago, the extension of CTL with quantification over atomic
propositions has never been studied extensively. Considering two different semantics …
propositions has never been studied extensively. Considering two different semantics …
Driving process improvement via comparative agility assessment
L Williams, K Rubin, M Cohn - 2010 Agile Conference, 2010 - ieeexplore.ieee.org
Rather than striving to be “perfectly agile,” some organizations desire to be more agile than
their competition and/or the industry. The Comparative Agility™(CA) assessment tool can be …
their competition and/or the industry. The Comparative Agility™(CA) assessment tool can be …
[HTML][HTML] Complexity of modal logics with Presburger constraints
S Demri, D Lugiez - Journal of Applied Logic, 2010 - Elsevier
We introduce the Extended Modal Logic EML with regularity constraints and full Presburger
constraints on the number of children that generalize graded modalities, also known as …
constraints on the number of children that generalize graded modalities, also known as …
Graded computation tree logic
A Bianco, F Mogavero, A Murano - ACM Transactions on Computational …, 2012 - dl.acm.org
In modal logics, graded (world) modalities have been deeply investigated as a useful
framework for generalizing standard existential and universal modalities in such a way that …
framework for generalizing standard existential and universal modalities in such a way that …
Walk logic as a framework for path query languages on graph databases
J Hellings, B Kuijpers, J Van den Bussche… - Proceedings of the 16th …, 2013 - dl.acm.org
Motivated by the current interest in languages for expressing path queries to graph
databases, this paper proposes to investigate Walk Logic (WL): the extension of first-order …
databases, this paper proposes to investigate Walk Logic (WL): the extension of first-order …