Results 1  10
of
31,303
Introducing CafeOBJ specifications in the Full Maude database. Integrating CafeOBJ with the Constructorbased Inductive Theorem Prover—Programmer Guide
, 2013
"... CafeOBJ and Maude are sister languages of the OBJ language, and two of the most advanced formal specification languages for systems verification. Although both of them have a similar syntax and semantics, different usages and applications have been developed for them. Hence, a tool combining both la ..."
Abstract
 Add to MetaCart
present how to extend a specific tool, the Constructorbased Inductive Theorem Prover (CITP), to deal with CafeOBJ specifications. This is achieved by creating an attribute that distinguishes the current language, combining the syntax of both tools, and defining rules that deal with the commands when our
Constructorbased Observational Logic ⋆
"... This paper focuses on the integration of reachability and observability concepts within an algebraic, institutionbased framework. In the first part of this work, we develop the essential ingredients that are needed to define the constructorbased observational logic institution, called COL, which ta ..."
Abstract
 Add to MetaCart
of the algebraic specification language Casl. This means, in particular, that any inductive theorem prover, such as e.g. Larch or PVS, can be used to prove theorems over structured COLspecifications.
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Constructorbased Conditional Narrowing
 In Proc. of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001
, 2001
"... We define a transformation from a leftlinear constructorbased conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound and complete for the computations in the source system. Since there exists a sound and complete narrowing strategy for t ..."
Abstract

Cited by 58 (25 self)
 Add to MetaCart
We define a transformation from a leftlinear constructorbased conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound and complete for the computations in the source system. Since there exists a sound and complete narrowing strategy
Observational Logic, ConstructorBased Logic, and their Duality
, 2002
"... Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this p ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
constructors, observational and constructorbased algebras, fully abstract and reachable algebras, and observational and inductive consequences of specifications. The formal duality between the observability and reachability concepts is established in a categorytheoretic setting.
ConstructorBased Inductive Validity in Positive/NegativeConditional Equational Specifications
 SEKIReport SR9305, FB Informatik
, 1993
"... : We study algebraic specifications given by finite sets R of positive/negativeconditional equations (i. e. universally quantified firstorder implications with a single equation in the succedent and a conjunction of positive and negative (i. e. negated) equations in the antecedent). The class of m ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of models of such a specification R does not contain in general a minimum model in the sense that it can be mapped to any other model by some homomorphism. We present a constructorbased approach for assigning appropriate semantics to such specifications. We introduce two syntactic restrictions: firstly
On Constructorbased Graph Rewriting Systems
 RESEARCH REPORT 985I, IMAG
, 1997
"... We address the problem of graph rewriting as the underlying operational semantics of rulebased programming languages. We define a new optimal graph rewriting strategy in the setting of orthogonal constructorbased graph rewriting systems. For this purpose, we first characterize a subset of graphs, ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
We address the problem of graph rewriting as the underlying operational semantics of rulebased programming languages. We define a new optimal graph rewriting strategy in the setting of orthogonal constructorbased graph rewriting systems. For this purpose, we first characterize a subset of graphs
ABSTRACT Constructorbased Conditional Narrowing ∗
"... We define a transformation from a leftlinear constructorbased conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound and complete for the computations in the source system. Since there exists a sound and complete narrowing strategy for th ..."
Abstract
 Add to MetaCart
We define a transformation from a leftlinear constructorbased conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound and complete for the computations in the source system. Since there exists a sound and complete narrowing strategy
A Bayesian method for the induction of probabilistic networks from data
 MACHINE LEARNING
, 1992
"... This paper presents a Bayesian method for constructing probabilistic networks from databases. In particular, we focus on constructing Bayesian belief networks. Potential applications include computerassisted hypothesis testing, automated scientific discovery, and automated construction of probabili ..."
Abstract

Cited by 1381 (32 self)
 Add to MetaCart
This paper presents a Bayesian method for constructing probabilistic networks from databases. In particular, we focus on constructing Bayesian belief networks. Potential applications include computerassisted hypothesis testing, automated scientific discovery, and automated construction of probabilistic expert systems. We extend the basic method to handle missing data and hidden (latent) variables. We show how to perform probabilistic inference by averaging over the inferences of multiple belief networks. Results are presented of a preliminary evaluation of an algorithm for constructing a belief network from a database of cases. Finally, we relate the methods in this paper to previous work, and we discuss open problems.
Results 1  10
of
31,303