Results 1  10
of
453
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3526 (46 self)
 Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional
Network Coding for Distributed Storage Systems
, 2008
"... Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peertopeer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, ..."
Abstract

Cited by 338 (13 self)
 Add to MetaCart
characterize using flow arguments on an appropriately constructed graph. By invoking constructive results in network coding, we introduce regenerating codes that can achieve any point in this optimal tradeoff.
Linear Objects: logical processes with builtin inheritance
, 1990
"... We present a new framework for amalgamating two successful programming paradigms: logic programming and objectoriented programming. From the former, we keep the declarative reading of programs. From the latter, we select two crucial notions: (i) the ability for objects to dynamically change their ..."
Abstract

Cited by 206 (6 self)
 Add to MetaCart
their internal state during the computation; (ii) the structured representation of knowledge, generally obtained via inheritance graphs among classes of objects. We start with the approach, introduced in concurrent logic programming languages, which identifies objects with proof processes and object states
Cayenne  a Language With Dependent Types
 IN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING
, 1998
"... Cayenne is a Haskelllike language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, i.e., the result type of a function may depend on the argument value, and types of record components (which can be types or values) may depend on other components. Cayenne also co ..."
Abstract

Cited by 240 (0 self)
 Add to MetaCart
suffice. It is also powerful enough to encode predicate logic at the type level, allowing types to be used as specifications of programs. However, this power comes at a cost: type checking of Cayenne is undecidable. While this may appear to be a steep price to pay, it seems to work well in practice.
The Pointer Assertion Logic Engine
 Proc. ACM PLDI
, 2001
"... We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were restricted ..."
Abstract

Cited by 156 (3 self)
 Add to MetaCart
in the logical tradition by encoding the programs and partial specifications as formulas in monadic secondorder logic. Validity of these formulas is checked by the MONA tool, which also can provide explicit counterexamples to invalid formulas. To make verification decidable, the technique requires explicit loop
Coherence in Finite Argument Systems
, 2001
"... Argument Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two important concepts of the acceptability of an argument p in such systems are credulous acceptance to capture the no ..."
Abstract

Cited by 87 (28 self)
 Add to MetaCart
. Our main result shows that the related decision problem is (p) 2 complete and is obtained solely via the graphtheoretic representation of an argument system, thus independent of the specific logic underpinning the reasoning theory.
OF PROPOSITIONAL LOGIC ARGUMENTS
"... Three experiments examined the manner in which logic novices (i.e., college undergraduates) process and represent elementary and relational properties of propositional logic arguments. These experiments used an old/new recognition procedure under conditions in which participants had ample (Experimen ..."
Abstract
 Add to MetaCart
(Experiment 1) or limited time (Experiments 2 and 3) to encode these arguments. Results of these experiments indicate that participants (1) represented both elementary and relational properties of logical arguments, (2) processed these properties in a serial manner, with elementary properties encoded
Real arguments are approximate arguments
 In AAAI’07, 66–71
"... There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logicbased argumentation is that an argument is a pair 〈Φ, α 〉 where Φ is minimal su ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logicbased argumentation is that an argument is a pair 〈Φ, α 〉 where Φ is minimal
Instantiating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties
, 2011
"... ... argumentation frameworks. In the first part, we propose desirable properties of attack relations in the form of postulates and classify several wellknown attack relations from the literature with regards to the satisfaction of these postulates. Furthermore, we provide additional postulates that ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
that help us prove characterisation results for these attack relations. In the second part of the paper, we present postulates regarding the logical content of extensions of argument graphs that may be constructed with classical logic. We then conduct a comprehensive study of the status of these postulates
AnswerSet Programming Encodings for Argumentation Frameworks
, 2008
"... We present reductions from Dung’s argumentation framework (AF) and generalizations thereof to logic programs under the answerset semantics. The reduction is based on a fixed disjunctive datalog program (the interpreter) and its input which is the only part depending on the AF to process. We discus ..."
Abstract

Cited by 25 (13 self)
 Add to MetaCart
We present reductions from Dung’s argumentation framework (AF) and generalizations thereof to logic programs under the answerset semantics. The reduction is based on a fixed disjunctive datalog program (the interpreter) and its input which is the only part depending on the AF to process. We
Results 1  10
of
453