Results 1  10
of
109
Rewriting Logic: Roadmap and Bibliography
, 2001
"... Machine [218]; (7) CCS and LOTOS [230,208,314,45,89,311,309,201]; (8) the calculus [316,292]; (9) concurrent objects and actors [218,220,300,302,304]; (10) the UNITY language [218]; (11) concurrent graph rewriting [223]; (12) dataflow [223]; (13) neural networks [223]; (14) realtime systems, inclu ..."
Abstract

Cited by 79 (16 self)
 Add to MetaCart
Machine [218]; (7) CCS and LOTOS [230,208,314,45,89,311,309,201]; (8) the calculus [316,292]; (9) concurrent objects and actors [218,220,300,302,304]; (10) the UNITY language [218]; (11) concurrent graph rewriting [223]; (12) dataflow [223]; (13) neural networks [223]; (14) realtime systems
Logic Programs as Term Rewriting Systems
, 1994
"... This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is defined which given a logic program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a onetoone correspondence between computed ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
of unification free programs containing SWM, the class of Flatly Well Moded (FWM) programs. Note: This work was done during an author's stay at CWI, Amsterdam. 1 Introduction The study of transforms from logic programs into term rewriting systems (TRSs for short) is an important topic. Theoretically
On a Dynamic Logic for Graph Rewriting ⋆
"... Abstract. Initially introduced by P. Balbiani, R. Echahed and A. Herzig, this dynamic logic is useful to talk about properties on termgraphs and to characterize transformations on these graphs. Also are presented the deterministic labelled graphs for which the logical framework is designed. This log ..."
Abstract
 Add to MetaCart
is not the topic here but the clear view brought to us by the formal work, so the results will be expressed using the original mathematical objects of this logic. Some problems of this logic are demonstrated, relatively to the representation of graph rewriting. Some are minor issues but some are far more important
CPO models for infinite term rewriting
 in Proc. AMAST'95, LNCS 936
, 1995
"... . Infinite terms in universal algebras are a wellknown topic since the seminal work of the ADJ group [1]. The recent interest in the field of term rewriting (tr) for infinite terms is due to the use of term graph rewriting to implement tr, where terms are represented by graphs: so, a cyclic gra ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
. Infinite terms in universal algebras are a wellknown topic since the seminal work of the ADJ group [1]. The recent interest in the field of term rewriting (tr) for infinite terms is due to the use of term graph rewriting to implement tr, where terms are represented by graphs: so, a cyclic
SPARQL Query Rewriting for Implementing Data Integration over Linked Data
"... There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community 1. The presence on the Web of such a huge information cloud, ranging from academic to geographic to gene related information, poses a great challenge when it comes to rec ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
. The semantics of ontology alignments, often defined over a logical frameworks, implies a reasoning step over huge amounts of data, that is often hard to implement and rarely scales on Web dimensions. This paper presents an algorithm for achieving RDF data mediation based on SPARQL query rewriting. The approach
Theorem Proving in HigherOrder Logic
"... The focus of this lecture series will be HOL, Church's higherorder logic, which is the core of many interactive theorem provers. We will cover the following topics: Foundations: HOL contains only simply typed lambda terms over equality and implication and a few inference rules for these consta ..."
Abstract
 Add to MetaCart
The focus of this lecture series will be HOL, Church's higherorder logic, which is the core of many interactive theorem provers. We will cover the following topics: Foundations: HOL contains only simply typed lambda terms over equality and implication and a few inference rules
Functional Logic Origami Programming with Open CFLP, Challenging the
 Boundaries of Symbolic Computation, Proceedings of 5th International Mathematica Symposium (IMS'2003
, 2003
"... Origami is a Japanese traditional art of paper folding. Recently, Origami became a topic of active research due to its relation to art, geometry, theorem proving, and declarative programming. It has been recognized that several interesting mathematical problems can be described in an elegant way by ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
operations are defined by conditional rewrite rules. We show that paper folding constructs can be expressed as systems of equations which are then solved by Open CFLP. Both components of our programming environment are implemented in Mathematica. We illustrate functional logic origami programming with some
HigherOrder FunctionalLogic Programming: A Systematic Development
 In Proc. of the Second Fuji International Workshop on Functional and Logic Programming. World Scientific
, 1997
"... We develop an effective model for higherorder functionallogic programming by refining higherorder narrowing calculi. The refinements reduce the high degree of nondeterminism in narrowing calculi, utilizing properties of functional(logic) programs. These include convergent and leftlinear rewrit ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
calculus which integrates higherorder functional and logic programming, based on narrowing. Narrowing is a general method for solving equations modulo a set of rewrite rules. Functionallogic languages with a sound and complete operational semantics are mainly based on narrowing. For a survey on the topic
Alfred Sidgwick: A LittleKnown Precursor of Informal Logic and Argumentation
"... Alfred Sidgwick (1850Sidgwick ( 1943 is such an obscure figure in philosophy that whenever his name is brought up, inevitably people confuse him with his wellknown cousin Henry Sidgwick. Although he wrote six books on practical logic (listed below), and wrote many articles in this area, mostly pu ..."
Abstract
 Add to MetaCart
published in the journal Mind a list of these is given in the bibliography (in Nielsen, 1997) hardly anyone seems to know who Sidgwick is. Hamblin (1970, p. 176) wrote that although Sidgwick was the only person to have tried to develop a theory of logic around the study of fallacies, 'the result
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
 Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of concepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, properties, relations etc.) not completely but by means of their reflections (i.e. approximations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.
Results 1  10
of
109