Results 1  10
of
1,095,218
Efficient Well‐Definedness Checking
 Proceedings of the International Joint Conference on Automated Reasoning (IJCAR
, 2008
"... Abstract. Formal specifications often contain partial functions that may lead to illdefined terms. A common technique to eliminate illdefined terms is to require welldefinedness conditions to be proven. The main advantage of this technique is that it allows us to reason in a twovalued logic even i ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Formal specifications often contain partial functions that may lead to illdefined terms. A common technique to eliminate illdefined terms is to require welldefinedness conditions to be proven. The main advantage of this technique is that it allows us to reason in a twovalued logic even
On deciding welldefinedness for query languages on trees
 Journal of the ACM
, 2005
"... The welldefinedness problem for a database query language consists of checking, given an expression and an input type, that the expression never yields a runtime error on any input adhering to the input type. In this article we study the welldefinedness problem for query languages on trees that ar ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The welldefinedness problem for a database query language consists of checking, given an expression and an input type, that the expression never yields a runtime error on any input adhering to the input type. In this article we study the welldefinedness problem for query languages on trees
Welldefinedness of Streams by Termination
 In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA’09
, 2009
"... Abstract. Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a TRS in such a way that termination of the resulting TRS implies that the stream specification a ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
admits a unique solution. As a consequence, proving such welldefinedness of several interesting stream specifications can be done fully automatically using present powerful tools for proving TRS termination. 1
Deciding WellDefinedness of XQuery Fragments
"... Unlike in traditional query languages, expressions in XQuery can have an undefined meaning (i.e., these expressions produce a runtime error). It is hence natural to ask whether we can solve the welldefinedness problem for XQuery: given an expression and an input type, check whether the semantics o ..."
Abstract
 Add to MetaCart
Unlike in traditional query languages, expressions in XQuery can have an undefined meaning (i.e., these expressions produce a runtime error). It is hence natural to ask whether we can solve the welldefinedness problem for XQuery: given an expression and an input type, check whether the semantics
Welldefinedness and efficient inference for probabilistic logic programming under the distribution semantics. Theory and Practice of Logic Programming
 BIBLIOGRAPHY
"... ar ..."
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 753 (40 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
Rewriting and WellDefinedness within a Proof System
"... Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with potentially illdefined terms. In this paper, we provide a basis for integrating rewriting with a deductive proof system that deals with welldefinedness. The definitions and theorems presented in this paper
Rewriting and WellDefinedness within a Proof System∗
"... Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If ..."
Abstract
 Add to MetaCart
. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with potentially illdefined terms. In this paper, we provide a basis for integrating rewriting with a deductive proof system that deals with welldefinedness. The definitions and theorems presented in this paper
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 817 (67 self)
 Add to MetaCart
We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class of problems. According to the tests we have done so far, the optimizations substantially improve the time performance of the system.
Results 1  10
of
1,095,218