Results 1 - 10 of 1,737

Model Exploration with Temporal Logic Query Checking

by Arie Gurfinkel, Benet Devereux, Marsha Chechik - IN PROCEEDINGS OF SIGSOFT CONFERENCE ON FOUNDATIONS OF SOFTWARE ENGINEERING (FSE'02 , 2002
"... A temporal logic query is a temporal logic formula with placeholders. Given a model, a solution to a query is a set of assignments of propositional formulas to placeholders, such that replacing the placeholders with any of these assignments results in a temporal logic formula that holds in the model ..."
Abstract - Cited by 20 (9 self) - Add to MetaCart
in the model. Query checking, first introduced by William Chan [2], is an automated technique for finding solutions to temporal logic queries. It allows discovery of the temporal properties of the system and as such may be a useful tool for model exploration and reverse engineering. This paper

Efficient Temporal-Logic Query Checking for Presburger Systems

by Dezhuang Zhang, et al. , 2005
"... This paper develops a framework for solving temporal-logic query-checking problems for a class of infinite-state system models that compute with integer-valued variables (so-called Presburger systems, in which Presburger formulas are used to define system behavior). The temporal-logic query-checking ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
This paper develops a framework for solving temporal-logic query-checking problems for a class of infinite-state system models that compute with integer-valued variables (so-called Presburger systems, in which Presburger formulas are used to define system behavior). The temporal-logic query-checking

Temporal Logic Query Checking: A Tool for Model Exploration

by Arie Gurfinkel, Marsha Chechik, Benet Devereux - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING , 2003
"... Temporal logic query checking was first introduced by W. Chan in order to speed up design understanding by discovering properties not known a priori. A query is a temporal logic formula containing a special symbol?1, known as a placeholder. Given a Kripke structure and a propositional formula’, we ..."
Abstract - Cited by 13 (5 self) - Add to MetaCart
Temporal logic query checking was first introduced by W. Chan in order to speed up design understanding by discovering properties not known a priori. A query is a temporal logic formula containing a special symbol?1, known as a placeholder. Given a Kripke structure and a propositional formula’, we

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base

Temporal Logic Query Checking through Multi-Valued Model Checking

by Arie Gurfinkel, Marsha Chechik , 2002
"... William Chan [3] to speed up design understanding by discovering properties not known a priori. A query is a temporal logic formula containing a special symbol ? 1 , known as a placeholder. Given a Kripke structure and a propositional formula ', we say that ' satisfies the query if replaci ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
William Chan [3] to speed up design understanding by discovering properties not known a priori. A query is a temporal logic formula containing a special symbol ? 1 , known as a placeholder. Given a Kripke structure and a propositional formula ', we say that ' satisfies the query

Consistently updating XML documents using incremental constraint query checks

by Bintou Kane - In Web Information and Data Management (WIDM’02 , 2002
"... When updating a valid XML Data or Schema, an efcient yet light-weight mechanism is needed to determine if the update would invalidate the document. Towards this goal, we have developed a framework called SAXE. First, we analyzed the constraints expressed in XML schema specications to establish const ..."
Abstract - Cited by 16 (0 self) - Add to MetaCart
, we illustrate that this set of incremental constraint checks can be specied using generic XQuery expressions composed of three type of components. Safe updates for the XML data have the following components: (1) XML schema meta-queries to retrieve any con-straint knowledge potentially relevant

Summary cache: A scalable wide-area web cache sharing protocol

by Li Fan, Pei Cao, Jussara Almeida, Andrei Z. Broder , 1998
"... The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called "Summary Cache"; each proxy keeps a su ..."
Abstract - Cited by 894 (3 self) - Add to MetaCart
summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical -- as low as 8 bits per

Predicting Query Performance

by Steve Cronen-Townsend, Yun Zhou, W. Bruce Croft , 2002
"... We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resulting clarity score measures the coherence of the language usage in documents whose models are likely to generate the query. ..."
Abstract - Cited by 269 (16 self) - Add to MetaCart
information. We develop an algorithm for automatically setting the clarity score threshold between predicted poorly-performing queries and acceptable queries and validate it using TREC data. In particular, we compare the automatic thresholds to optimum thresholds and also check how frequently results as good

On the Decidability of Query Containment under Constraints

by Diego Calvanese, Giuseppe De Giacomo, et al.
"... Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we addr ..."
Abstract - Cited by 256 (56 self) - Add to MetaCart
Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we

The Object-Oriented Database System Manifesto

by Malcolm Atkinson, François Bancilhon, David DeWitt, Klaus Dittrich, David Maier, Stanley Zdonik , 1989
"... This paper attempts to define an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented database system. We have separated these characteristics into three groups: ffl Mandatory, the ones the system must satisfy in ..."
Abstract - Cited by 361 (5 self) - Add to MetaCart
query facility. ffl Optional, the ones that can be added to make the system better, but which are not mandatory. These are multiple inheritance, type checking and inferencing, distribution, design transactions and versions. ffl Open, the points where the designer can make a number of choices
Results 1 - 10 of 1,737