Results 1 - 10
of
354
Practical Epistemic Entailment Checking in SROIQ
"... Abstract. In this paper, we present a reasoner capable of epistemic inferences in SROIQ knowledge bases. We first identify some counter intuitive effects of imposing the traditional semantics in epistemic extensions of expressive description logics (DLs). Thus, we provide a revised downward compatib ..."
Abstract
- Add to MetaCart
Abstract. In this paper, we present a reasoner capable of epistemic inferences in SROIQ knowledge bases. We first identify some counter intuitive effects of imposing the traditional semantics in epistemic extensions of expressive description logics (DLs). Thus, we provide a revised downward compatible semantics with a more intuitive behavior in such cases. Based on the new semantics, we present a reduction method for epistemic queries to standard DL reasoning. This enables us to deploy state-of-the-art DL reasoners for such non-standard inferences. Additionally, we provide an implementation of our approach and present first evaluation results. 1
Light-Weight Entailment Checking for Computational Semantics
- In Proc. of the 3 rd Workshop on Inference in Computational Semantics
, 2001
"... Inference tasks in computational semantics have mostly been tackled by means of first-order theorem proving tools. While this is an important and welcome development, it has some inherent limitations. First, generating first-order logic representations of natural language documents is hampered b ..."
Abstract
-
Cited by 20 (0 self)
- Add to MetaCart
Inference tasks in computational semantics have mostly been tackled by means of first-order theorem proving tools. While this is an important and welcome development, it has some inherent limitations. First, generating first-order logic representations of natural language documents is hampered by the lack of efficient and sufficiently robust NLP tools. Second, the computational costs of deploying first-order logic theorem proving tools in realworld situations may be prohibitive. And third, the strict yes/no decisions delivered by such tools are not always appropriate. In this paper we report on an approach to inference in semantics that works on very minimal representations which can easily be generated for arbitrary domains. Moreover, our approach is computationally efficient, and provides graded outcomes instead of strict yes/no decisions. Our approach is fully implemented, and a preliminary evaluation of the approach is discussed in the paper. 1
Compositional entailment checking for a fragment of separation logic
- In APLAS
"... Abstract. We present a (semi-)decision procedure for checking entailment be-tween 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 be-tween 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
A theory of type polymorphism in programming
- Journal of Computer and System Sciences
, 1978
"... The aim of this work is largely a practical one. A widely employed style of programming, particularly in structure-processing languages which impose no discipline of types, entails defining procedures which work well on objects of a wide variety. We present a formal type discipline for such polymorp ..."
Abstract
-
Cited by 1076 (1 self)
- Add to MetaCart
The aim of this work is largely a practical one. A widely employed style of programming, particularly in structure-processing languages which impose no discipline of types, entails defining procedures which work well on objects of a wide variety. We present a formal type discipline
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing agent ..."
Abstract
-
Cited by 502 (16 self)
- Add to MetaCart
This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing
Entailment of Finite Domain Constraints
, 1994
"... Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by anti-monotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to a ..."
Abstract
-
Cited by 22 (6 self)
- Add to MetaCart
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by anti-monotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough
On the Complexity of Entailment in Propositional Multivalued Logics
, 1997
"... Multivalued logics have a long tradition in the philosophy and logic literature that originates from the work by / Lukaszewicz in the 20's. More recently, many AI researchers have been interested in this topic for both semantic and computational reasons. Multivalued logics have indeed been freq ..."
Abstract
-
Cited by 24 (0 self)
- Add to MetaCart
on the relative sizes of the inputs have on the complexity of entailment checking. In particular we show new polynomial cases and generalize polynomial cases already known in the literature for various popular multivalued logics. Such polynomial cases are obtained by means of two simple algorithms, sharing a
Existential heap abstraction entailment is undecidable
- In 10th Annual International Static Analysis Symposium (SAS 2003
, 2003
"... Abstract. In this paper we study constraints for specifying properties of data structures consisting of linked objects allocated in the heap. Motivated by heap summary graphs in role analysis and shape analysis we introduce the notion of regular graph constraints. A regular graph constraint is a gra ..."
Abstract
-
Cited by 15 (7 self)
- Add to MetaCart
static analysis is proving that procedure preconditions are satisfied at every call site. For role analysis, precondition checking requires determining the validity of implication, i.e., entailment of regular graph constraints. The central result of this paper is the undecidability of regular graph
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a sim-ple and powerful model of concurrent computation based on the notions of store-as-constraint and process as information transducer. The store-as-valuation conception of von Neu-mann computing is replaced by the notion that the store is a constr ..."
Abstract
-
Cited by 276 (27 self)
- Add to MetaCart
constraint (a finite representation of a possibly infinite set of valuations) which provides partial information about the possible values that variables can take. Instead of “reading” and “writing ” the values of variables, processes may now ask (check if a constraint is entailed by the store) and tell
An Open-Ended Finite Domain Constraint Solver
, 1997
"... We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint interface. The solver is essentially a scheduler for indexicals, i.e. reactive functional rules encodin ..."
Abstract
-
Cited by 194 (8 self)
- Add to MetaCart
encoding local consistency methods performing incremental constraint solving or entailment checking, and global constraints, i.e. general propagators which may use specialized algorithms to achieve a higher degree of consistency or better time and space complexity. The solver has an open-ended design
Results 1 - 10
of
354