Results 1  10
of
409
Eliminating the fixed predicates from a circumscription
 Artificial Intelligence
, 1989
"... Parallel predicate circumscription is the primary circumscriptive technique used in formalizing commonsense reasoning. In this paper we present a direct syntactic construction for transforming any parallel predicate circumscription usingfixed predicates into an equivalent one which does not. Thus, w ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
, we show that predicate circumscription is no iiiore expressive with fixed predicates than without. We extend this result to prioritized circumscription. These results are expected to be usefulfor comparing circumscription to other nonmonotonic formalisms (such as autoepistemic logic
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed. Throughout this paper, a set of strings 1 means a set of strings on some fixed, large, finite
Relational Queries Computable in Polynomial Time
 Information and Control
, 1986
"... We characterize the polynomial time computable queries as those expressible in relational calculus plus a least fixed point operator and a total ordering on the universe. We also show that even without the ordering one application of fixed point suffices to express any query expressible with several ..."
Abstract

Cited by 318 (17 self)
 Add to MetaCart
We characterize the polynomial time computable queries as those expressible in relational calculus plus a least fixed point operator and a total ordering on the universe. We also show that even without the ordering one application of fixed point suffices to express any query expressible
MINIMAL PREDICATES, FIXEDPOINTS, AND DEFINABILITY
, 2004
"... Minimal predicates P satisfying a given firstorder description (P) occur widely in mathematical logic and computer science. We give an explicit firstorder syntax for special firstorder 'PIA conditions' (P) which guarantees unique existence of such minimal predicates. Our main technical ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
MIN(FO) equal in expressive power to LFP(FO), firstorder logic closed under smallest fixedpoints for monotone operations. As a concrete illustration of these notions, we show how our sort of predicate minimization extends the usual frame correspondence theory of modal logic, leading to a proper
with Inductive Predicates
, 2013
"... In this paper we show that the satisfiability problem for a fragment of separation logic with general inductively defined predicates, commonly employed in program verification, is decidable. Our decision procedure computes a fixed point corresponding to the “base ” of an inductive predicate that exa ..."
Abstract
 Add to MetaCart
In this paper we show that the satisfiability problem for a fragment of separation logic with general inductively defined predicates, commonly employed in program verification, is decidable. Our decision procedure computes a fixed point corresponding to the “base ” of an inductive predicate
A Calculus for Predicative Programming
, 1993
"... . A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are well known from the specification language Z. All elements of a simple sequential programming notation are defined in ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
in terms of predicates. Hence programs form a subset of specifications. In particular, sequential composition is defined by 'demonic composition', nondeterministic choice by 'demonic disjunction', and iteration by fixed points. Laws are derived which allow proving equivalence
Computing on Authenticated Data for Adjustable Predicates
"... Abstract. The notion of Phomomorphic signatures, introduced by Ahn et al. (TCC 2012), generalizes various approaches for public computations on authenticated data. For a given predicate P anyone can derive a signature for a message m ′ from the signatures of a set of messages M, as long as P(M, m ′ ..."
Abstract
 Add to MetaCart
when signing a message, instead of supporting only a single, fixed predicate. We present two main results. One is to show that one can indeed devise solutions for the static combination for AND, and for dynamically adjustable solutions for choosing the predicate on the fly. Moreover, our constructions
Predicative Specification of Timed Processes
 REX 1991, LNCS
, 1991
"... We present a model for the specification of time restrictions in communicating systems that is based on predicates. The model fits for continuous and discrete time domains, but we fix our attention to the nonnegative reals. It is possible to express delays, timed interrupts and the requirement t ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We present a model for the specification of time restrictions in communicating systems that is based on predicates. The model fits for continuous and discrete time domains, but we fix our attention to the nonnegative reals. It is possible to express delays, timed interrupts and the requirement
Predicative Semantics of Loops
, 1997
"... A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the obvious weakest fixedpoint semantics of iterative constructs unacceptable. This paper proposes an alternative. We will se ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the obvious weakest fixedpoint semantics of iterative constructs unacceptable. This paper proposes an alternative. We
Observation Predicates in Flow Logic
"... Abstract. Motivated by the connection between strong and soft type systems we explore flow analyses with hard constraints on the admissible solutions. We show how to use observation predicates and formula rearrangements to map flow analyses with hard constraints into more traditional flow analyses i ..."
Abstract
 Add to MetaCart
Abstract. Motivated by the connection between strong and soft type systems we explore flow analyses with hard constraints on the admissible solutions. We show how to use observation predicates and formula rearrangements to map flow analyses with hard constraints into more traditional flow analyses
Results 1  10
of
409