Results 1  10
of
21,309
A logic for algebraic effects
 IN 4TH FOSSACS
, 2001
"... We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the acalculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended to ..."
Abstract

Cited by 40 (14 self)
 Add to MetaCart
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the acalculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1012 (7 self)
 Add to MetaCart
possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not effective; however, it is quite useful as a descriptive tool. A more conventional way to obtain a
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
regular fashion. These arise regularly in connection with extremal structures: such structures often have an unexpected degree of regularity and, because of this, often give rise to an association scheme. This in turn leads to a semisimple commutative algebra and the representation theory of this algebra
Learning logical definitions from relations
 MACHINE LEARNING
, 1990
"... This paper describes FOIL, a system that learns Horn clauses from data expressed as relations. FOIL is based on ideas that have proved effective in attributevalue learning systems, but extends them to a firstorder formalism. This new system has been applied successfully to several tasks taken fro ..."
Abstract

Cited by 935 (8 self)
 Add to MetaCart
This paper describes FOIL, a system that learns Horn clauses from data expressed as relations. FOIL is based on ideas that have proved effective in attributevalue learning systems, but extends them to a firstorder formalism. This new system has been applied successfully to several tasks taken
GOLOG: A Logic Programming Language for Dynamic Domains
, 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract

Cited by 628 (74 self)
 Add to MetaCart
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world
Automating the Design of Graphical Presentations of Relational Information
 ACM Transactions on Graphics
, 1986
"... The goal of the research described in this paper is to develop an applicationindependent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal: The codi ..."
Abstract

Cited by 559 (9 self)
 Add to MetaCart
are sentences of graphical languages. The graphic design issues are codified as expressiveness and effectiveness criteria for graphical languages. Expressiveness criteria determine whether a graphical language can express the desired information. Effectiveness criteria determine whether a graphical language
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
in convergence analysis of consensus protocols. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate
Maintaining knowledge about temporal intervals
 COMMUNICATION OF ACM
, 1983
"... The problem of representing temporal knowledge arises in many areas of computer science. In applications in which such knowledge is imprecise or relative, current representations based on date lines or time instants are inadequate. An intervalbased temporal logic is introduced, together WiUl a comp ..."
Abstract

Cited by 2942 (13 self)
 Add to MetaCart
The problem of representing temporal knowledge arises in many areas of computer science. In applications in which such knowledge is imprecise or relative, current representations based on date lines or time instants are inadequate. An intervalbased temporal logic is introduced, together WiUl a
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
, indeterministic choice, interleaving, and hiding, and provides a mutual recursion operator. cc(.L,t) is (intentionally!) very similar to Milner’s CCS, but for the radically different underlying concept of communication, which, in fact, pro’ The class is founded on the notion of “constraint logic pro
Consensus and cooperation in networked multiagent systems
 Proceedings of the IEEE
, 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An ove ..."
Abstract

Cited by 807 (4 self)
 Add to MetaCart
Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees
Results 1  10
of
21,309