Results 1  10
of
3,900
A Syntactic Approach to Type Soundness
 INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract

Cited by 629 (22 self)
 Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 376 (38 self)
 Add to MetaCart
modelchecking for branchingtime logics), we consider the more general class of alternating pushdown systems and use alternating finitestate automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors
Query Answering for OWLDL with Rules
 Journal of Web Semantics
, 2004
"... Both OWLDL and functionfree Horn rules are decidable fragments of firstorder logic with interesting, yet orthogonal expressive power. A combination of OWLDL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, w ..."
Abstract

Cited by 329 (28 self)
 Add to MetaCart
Both OWLDL and functionfree Horn rules are decidable fragments of firstorder logic with interesting, yet orthogonal expressive power. A combination of OWLDL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here
Logical minimisation of metarules within MetaInterpretive Learning
"... Abstract. MetaInterpretive Learning (MIL) is an ILP technique which uses higherorder metarules to support predicate invention and learning of recursive definitions. In MIL the selection of metarules is analogous to the choice of refinement operators in a refinement graph search. The metarules d ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
demonstrate that irreducible, or minimal sets of metarules can be found automatically by applying Plotkin’s clausal theory reduction algorithm. When this approach is applied to a set of metarules consisting of an enumeration of all metarules in a given finite hypothesis language we show that in some cases
Automatic Ordering of Predicates by Metarules
, 1996
"... I describe metarules which order predicates contained in first order logic rules. These metarules are applied to rules created by a learning Go program. After the ordering of the predicates, the rules are matched orders of magnitude faster than the original learned rules. Key words : Metaprogrammin ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
I describe metarules which order predicates contained in first order logic rules. These metarules are applied to rules created by a learning Go program. After the ordering of the predicates, the rules are matched orders of magnitude faster than the original learned rules. Key words
Encoding Plans in Propositional Logic
, 1996
"... In recent work we showed that planning problems can be efficiently solved by general propositional satisfiability algorithms (Kautz and Selman 1996). A key issue in this approach is the development of practical reductions of planning to SAT. We introduce a series of different SAT encodings for STRIP ..."
Abstract

Cited by 173 (9 self)
 Add to MetaCart
In recent work we showed that planning problems can be efficiently solved by general propositional satisfiability algorithms (Kautz and Selman 1996). A key issue in this approach is the development of practical reductions of planning to SAT. We introduce a series of different SAT encodings
Metarules to Improve Tactical Go Knowledge
"... Three main problems arise with automatically generated rules databases. They are too large to fit in memory, they can take a lot of time to generate, and it takes time to match many rules on a board. I propose to use exceptions and metarules to reduce the size of the databases. The reduction in size ..."
Abstract
 Add to MetaCart
Three main problems arise with automatically generated rules databases. They are too large to fit in memory, they can take a lot of time to generate, and it takes time to match many rules on a board. I propose to use exceptions and metarules to reduce the size of the databases. The reduction
Learning MetaRules Of Selection In Expert Systems
"... Rule selection in forward chaining is a critical factor in the performance of expert systems. Uninformed selection causes many rules to be fired, that are not useful in the attainment of the reasoning goal. As a result, users have to answer more questions than needed and the system's performanc ..."
Abstract
 Add to MetaCart
's performance is degraded. Domainspecific metarules have been used to improve rule selection. However, in most instances, such metarules are elicited from experts and thus costly to obtain and difficult to validate. This paper describes a method for improving rule selection automatically and adaptively
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
 ACM Transactions on Computational Logic
, 1999
"... The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary Deci ..."
Abstract

Cited by 103 (29 self)
 Add to MetaCart
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary
A unified computation model for functional and logic programming
 IN PROC. OF THE 24TH ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES (PARIS
, 1997
"... We propose a new computation model which combines the operational principles of functional languages (reduction), logic languages (nondeterministic search for solutions), and integrated functional logic languages (residuation and narrowing). This computation model combines efficient evaluation prin ..."
Abstract

Cited by 143 (71 self)
 Add to MetaCart
We propose a new computation model which combines the operational principles of functional languages (reduction), logic languages (nondeterministic search for solutions), and integrated functional logic languages (residuation and narrowing). This computation model combines efficient evaluation
Results 1  10
of
3,900