Results 1  10
of
87
Foundations for decision problems in separation logic with general inductive predicates
 In Proc. FoSSaCS 2014
, 2014
"... Abstract. We establish foundational results on the computational complexity of deciding entailment in Separation Logic with general inductive predicates whose underlying base language allows for pure formulas, pointers and existentially quantified variables. We show that entailment is in general u ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Abstract. We establish foundational results on the computational complexity of deciding entailment in Separation Logic with general inductive predicates whose underlying base language allows for pure formulas, pointers and existentially quantified variables. We show that entailment is in general
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 decision procedure for satisfiability in separation logic with inductive predicates, in: LICS’14
, 2014
"... We show that the satisfiability problem for the “symbolic heap” fragment of separation logic with general inductively defined predicates — which includes most fragments employed in program verification — is decidable. Our decision procedure is based on the computation of a certain fixed point from ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We show that the satisfiability problem for the “symbolic heap” fragment of separation logic with general inductively defined predicates — which includes most fragments employed in program verification — is decidable. Our decision procedure is based on the computation of a certain fixed point
Compositional entailment checking for a fragment of separation logic
 In APLAS
"... Abstract. We present a (semi)decision procedure for checking entailment between separation logic formulas with inductive predicates specifying complex data structures corresponding to finite nesting of various kinds of linked lists: acyclic or cyclic, singly or doubly linked, skip lists, etc. The ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We present a (semi)decision procedure for checking entailment between separation logic formulas with inductive predicates specifying complex data structures corresponding to finite nesting of various kinds of linked lists: acyclic or cyclic, singly or doubly linked, skip lists, etc
BOOK REVIEWS THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic)
"... The Decision Problem (Entscheidungsproblem) was brought to the attention of the mathematical community by Hilbert in 1922 as part of his formalist programme for the foundations of mathematics, and he considered it to be the most important problem of mathematical logic at the time. It consists in fin ..."
Abstract
 Add to MetaCart
The Decision Problem (Entscheidungsproblem) was brought to the attention of the mathematical community by Hilbert in 1922 as part of his formalist programme for the foundations of mathematics, and he considered it to be the most important problem of mathematical logic at the time. It consists
From Bayesian epistemology to inductive logic
 Journal of Applied Logic
, 2013
"... Abstract Inductive logic admits a variety of semantics (Haenni et al., 2011, Part 1). This paper develops semantics based on the norms of Bayesian epistemology (Williamson, 2010, Chapter 7). §1 introduces the semantics and then, in §2, the paper explores methods for drawing inferences in the resul ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
but not another. Accordingly we will accept all three norms in what follows, exploring the consequences of objective Bayesian epistemology for inductive logic. ¶ Predicate Languages. Thus far we have introduced Bayesian epistemology in the context of a propositional language. But the framework extends quite
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
ordinated decision making, and decentralized execution, which provide a superior social morphology for all human action. Networks decentre performance and share decisionmaking. By denition, a network has no centre. It works on a binar y logic: inclusion/exclusion. All there is in the network is useful and necessar
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
Shape analysis with inductive . . .
, 2008
"... For program optimization and verification purposes, shape analysis can be used to statically determine structural properties of the runtime heap. One promising formalism for describing heap is separation logic, with recursively defined predicates that allow for concise yet precise summarization of l ..."
Abstract
 Add to MetaCart
data types. This thesis addresses this problem by proposing a general algorithm based on inductive program synthesis that automatically infers recursive predicates in a canonical form. This technique yields a separation logic based shape analysis that can be effective on a much wider range of programs
Hyper Least General Generalization and its Application to HigherOrder Concept Learning
 Reserach Memo IEIRM 97001, SFC Research Institute, Keio University, 5322
"... We propose a simple extension to Popplestone and Plotkin's concept of Least General Generalization (LGG), in order to generalize literals with different predicates. We call this algorithm Hyper Least General Generalization (HLGG). We discuss the importance of HLGG's ability to do predicate ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
predicate invention, and explore the relationship between HLGG and the folding operation of program transformation. Using the inductive logic programming system GOLEM as a foundation, we apply HLGG to a problem which involves higher order concept learning, and describe an example which extracts a higher
Results 1  10
of
87