Results 1  10
of
1,790
Epistemic Probability Logic Simplified
"... We propose a simplified logic for reasoning about (multiagent) epistemic probability models, and for epistemic probabilistic model checking. Epistemic probability models are multiagent Kripke models that assign to each agent an equivalence relation on worlds, together with a function from worlds t ..."
Abstract
 Add to MetaCart
We propose a simplified logic for reasoning about (multiagent) epistemic probability models, and for epistemic probabilistic model checking. Epistemic probability models are multiagent Kripke models that assign to each agent an equivalence relation on worlds, together with a function from worlds
Epistemic Probability Logic Simplified
"... We propose a logic for reasoning about (multiagent) epistemic probability models, and for epistemic probabilistic model checking. Epistemic probability models are multiagent Kripke models that assign to each agent an equivalence relation on worlds, together with function from worlds to positive ..."
Abstract
 Add to MetaCart
We propose a logic for reasoning about (multiagent) epistemic probability models, and for epistemic probabilistic model checking. Epistemic probability models are multiagent Kripke models that assign to each agent an equivalence relation on worlds, together with function from worlds to positive
A Spatial Logic based on Regions and Connection
 PROCEEDINGS 3RD INTERNATIONAL CONFERENCE ON KNOWLEDGE REPRESENTATION AND REASONING
, 1992
"... We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its us ..."
Abstract

Cited by 745 (32 self)
 Add to MetaCart
We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its
Complexityeffective superscalar processors
 IN PROCEEDINGS OF THE 24TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE
, 1997
"... The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, instruction window wakeup and selection logic, and operand bypassing are analyzed. Each is modeled and Spice simulated for ..."
Abstract

Cited by 467 (5 self)
 Add to MetaCart
for feature sizes of 0:8m, 0:35m, and 0:18m. Performance results and trends are expressed in terms of issue width and window size. Our analysis indicates that window wakeup and selection logic as well as operand bypass logic are likely to be the most critical in the future. A microarchitecture that simplifies
Splitting a Logic Program
 Principles of Knowledge Representation
, 1994
"... In many cases, a logic program can be divided into two parts, so that one of them, the \bottom " part, does not refer to the predicates de ned in the \top " part. The \bottom " rules can be used then for the evaluation of the predicates that they de ne, and the computed va ..."
Abstract

Cited by 294 (16 self)
 Add to MetaCart
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom " part, does not refer to the predicates de ned in the \top " part. The \bottom " rules can be used then for the evaluation of the predicates that they de ne, and the computed
Venti: A New Approach to Archival Storage
, 2002
"... This paper describes a network storage system, called Venti, intended for archival data. In this system, a unique hash of a block's contents acts as the block identifier for read and write operations. This approach enforces a writeonce policy, preventing accidental or malicious destruction of ..."
Abstract

Cited by 342 (0 self)
 Add to MetaCart
of data. In addition, duplicate copies of a block can be coalesced, reducing the consumption of storage and simplifying the implementation of clients. Venti is a building block for constructing a variety of storage applications such as logical backup, physical backup, and snapshot file systems.
Strongly Equivalent Logic Programs
 ACM Transactions on Computational Logic
, 2000
"... A logic program 1 is said to be equivalent to a logic program 2 in the sense of the answer set semantics if 1 and 2 have the same answer sets. We are interested in the following stronger condition: for every logic program , 1 [ has the same answer sets as 2 [ . The study of strong equival ..."
Abstract

Cited by 231 (36 self)
 Add to MetaCart
equivalence is important, because we learn from it how one can simplify a part of a logic program without looking at the rest of it. The main theorem shows that the verication of strong equivalence can be accomplished by checking the equivalence of formulas in a monotonic logic, called the logic of here
Constraint Handling Rules
 Constraint Programming: Basics and Trends, LNCS 910
, 1995
"... . We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of cons ..."
Abstract

Cited by 224 (33 self)
 Add to MetaCart
. We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination
Simplified Quantum Logic with Trapped Ions
 Physical Review A, 55, Issue
, 1997
"... We describe a simplified scheme for quantum logic with a collection of lasercooled trapped atomic ions. Building on the scheme of Cirac and Zoller, we show how the fundamental controlledNOT gate between a collective mode of ion motion and the internal states of a single ion can be reduced to a sin ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We describe a simplified scheme for quantum logic with a collection of lasercooled trapped atomic ions. Building on the scheme of Cirac and Zoller, we show how the fundamental controlledNOT gate between a collective mode of ion motion and the internal states of a single ion can be reduced to a
Simplifying logic programs under uniform and strong equivalence
 In LPNMR’04
, 2004
"... Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, respectively. Both notions have recently been considered for nonmonotonic logic programs (the latter dates back to the 198 ..."
Abstract

Cited by 42 (21 self)
 Add to MetaCart
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, respectively. Both notions have recently been considered for nonmonotonic logic programs (the latter dates back
Results 1  10
of
1,790