Results 1  10
of
463
Ramification and Causality
 Artificial Intelligence
, 1997
"... The ramification problem in the context of commonsense reasoning about actions and change names the challenge to accommodate actions whose execution causes indirect effects. Not being part of the respective action specification, such effects are consequences of general laws describing dependencies b ..."
Abstract

Cited by 162 (25 self)
 Add to MetaCart
The ramification problem in the context of commonsense reasoning about actions and change names the challenge to accommodate actions whose execution causes indirect effects. Not being part of the respective action specification, such effects are consequences of general laws describing dependencies between components of the world description. We present a general approach to this problem which incorporates causality, formalized by directed relations between two single effects stating that, under specific circumstances, the occurrence of the first causes the second. Moreover, necessity of exploiting causal information in this way or a similar is argued by elaborating the limitations of common paradigms employed to handle ramifications, namely, the principle of categorization and the policy of minimal change. Our abstract solution is exemplarily integrated into a specific calculus based on the logic programming paradigm. To apper in: Artificial Intelligence Journal On leave from FG Inte...
THE PRINCIPAL DESIGN OBJECTIVE
"... Achieving its high performance and large storage capacity required sophisticated design methods and tested the known limits of some manufacturing processes. by Herbert P. Stickel ..."
Abstract
 Add to MetaCart
Achieving its high performance and large storage capacity required sophisticated design methods and tested the known limits of some manufacturing processes. by Herbert P. Stickel
Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview
, 1994
"... Properties. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and NonMonotonic Reasoning, Proceedings of the Second International Workshop, pages 4359. Lisbon, MIT Press, July 1993. [Min82] Jack Minker. On indefinite databases and the closed world assumption. In Proceedings of the ..."
Abstract

Cited by 75 (14 self)
 Add to MetaCart
Properties. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and NonMonotonic Reasoning, Proceedings of the Second International Workshop, pages 4359. Lisbon, MIT Press, July 1993. [Min82] Jack Minker. On indefinite databases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction, New York, pages 292308. Springer, 1982. [Min88a] Jack Minker. Foundations of Deductive Databases. Morgan Kaufmann, 95 First Street, Los Altos, CA 94022, 1st edition, 1988. [Min88b] Jack Minker. Perspectives in deductive Databases. Journal of Logic Programming, 5:3360, 1988. [Min89] Jack Minker. Toward a Foundation of Disjunctive Logic Programming. In Ewing L. Lusk and Ross A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 12151235. MIT Press, 1989. [Min91] Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. CSTR 2736, Computer Science Dept., Univ. Maryland, University of Marylan...
An Overview of Rewrite Rule Laboratory (RRL)
 J. of Computer and Mathematics with Applications
, 1995
"... RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a fullfledged theorem prover which has been used to solve hard and challenging mathematical proble ..."
Abstract

Cited by 69 (24 self)
 Add to MetaCart
RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a fullfledged theorem prover which has been used to solve hard and challenging mathematical problems in automated reasoning literature as well as a research tool for investigating the use of formal methods in hardware and software design. We provide a brief historical account of development of RRL and its descendants, give an overview of the main capabilities of RRL and conclude with a discussion of applications of RRL. Key words. RRL, rewrite techniques, equational logic, discrimination nets 1 Introduction The theorem prover RRL (Rewrite Rule Laboratory) is an automated reasoning program based on rewrite techniques. The theorem prover has implementations of completion procedures for generating a complete set of rewrite rules from an equational axiomatization, associativecommutative mat...
Experiments with DiscriminationTree Indexing and Path Indexing for Term Retrieval
 JOURNAL OF AUTOMATED REASONING
, 1990
"... This article addresses the problem of indexing and retrieving firstorder predicate calculus terms in the context of automated deduction programs. The four retrieval operations of concern are to find variants, generalizations, instances, and terms that unify with a given term. Discriminationtree ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
This article addresses the problem of indexing and retrieving firstorder predicate calculus terms in the context of automated deduction programs. The four retrieval operations of concern are to find variants, generalizations, instances, and terms that unify with a given term. Discriminationtree indexing is reviewed, and several variations are presented. The pathindexing method is also reviewed. Experiments were conducted on large sets of terms to determine how the properties of the terms affect the performance of the two indexing methods. Results of the experiments are presented.
Properties of Implied Cost of Capital Using Analysts' Forecasts." Working Pqer
, 2004
"... Short sections of text, not to exceed two paragraphs, may be quoted without ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
Short sections of text, not to exceed two paragraphs, may be quoted without
Incremental Theory Reasoning Methods for Semantic Tableaux
 In Proceedings, 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods
, 1996
"... . Theory reasoning is an important technique for increasing the efficiency of automated deduction systems. In this paper we present incremental theory reasoning, a method that improves the interaction between the foreground reasoner and the background (theory) reasoner and, thus, the efficiency of ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
to handle problems from a certain theory. Following the pioneering work of Stickel [23], so...
Promoting Rewriting to a Programming Language: A Compiler for NonDeterministic Rewrite Programs in AssociativeCommutative Theories
, 2001
"... Firstorder languages based on rewrite rules share many features with functional languages. But one difference is that matching and rewriting can be made much more expressive and powerful by incorporating some builtin equational theories. To provide reasonable programming environments, compilation ..."
Abstract

Cited by 40 (7 self)
 Add to MetaCart
Firstorder languages based on rewrite rules share many features with functional languages. But one difference is that matching and rewriting can be made much more expressive and powerful by incorporating some builtin equational theories. To provide reasonable programming environments, compilation techniques for such languages based on rewriting have to be designed. This is the topic addressed in this paper. The proposed techniques are independent from the rewriting language and may be useful to build a compiler for any system using rewriting modulo associative and commutative (AC) theories. An algorithm for manytoone AC matching is presented, that works efficiently for a restricted class of patterns. Other patterns are transformed to fit into this class. A refined data structure, namely compact bipartite graph, allows encoding all matching problems relative to a set of rewrite rules. A few optimisations concerning the construction of the substitution and of the reduced term are described. We also address the problem of nondeterminism related to AC rewriting and show how to handle it through the concept of strategies. We explain how an analysis of the determinism can be performed at compile time and we illustrate the benefits of this analysis for the performance of the compiled evaluation process. Then we briefly introduce the ELAN system and its compiler, in order to give some experimental results and comparisons with other languages or rewrite engines.
SpecificationBased Browsing of Software Component Libraries
 in Proceedings of ASE
, 1999
"... . Specificationbased retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specificationbased browsing evades this bottleneck by moving any deduction into an offline indexing phase. In this paper, we show how match relations are used to bui ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
. Specificationbased retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specificationbased browsing evades this bottleneck by moving any deduction into an offline indexing phase. In this paper, we show how match relations are used to build an appropriate index and how formal concept analysis is used to build a suitable navigation structure. This structure has the singlefocus property (i.e., any sensible subset of a library is represented by a single node) and supports attributebased (via explicit component properties) and objectbased (via implicit component similarities) navigation styles. It thus combines the exact semantics of formal methods with the interactive navigation possibilities of informal methods. Experiments show that current theorem provers can solve enough of the emerging proof problems to make browsing feasible. The navigation structure also indicates situations where additional abstractions are required ...
Results 1  10
of
463