Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
116
Rule ordering in bottom-up fixpoint evaluation of logic programs
- IEEE Transactions on Knowledge and Data Engineering
, 1990
"... Abstract Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable--and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics--to apply the ru ..."
Abstract
-
Cited by 44 (10 self)
- Add to MetaCart
Abstract Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable--and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics--to apply
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
- IEEE Transactions on Knowledge and Data Engineering
, 1990
"... Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable --- and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics --- to apply the rules in some ..."
Abstract
- Add to MetaCart
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable --- and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics --- to apply the rules
Abstract Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
"... Logic programs can be evaluated bottom-up by repeat-edly applying alI rules, in “iterations”, until the fixpoint is reached. However, it is often desirable- and in some cases, e.g. programs with stratified negation, even neces-sary to guarantee the semantics- to apply the rules in some order. An imp ..."
Abstract
- Add to MetaCart
Logic programs can be evaluated bottom-up by repeat-edly applying alI rules, in “iterations”, until the fixpoint is reached. However, it is often desirable- and in some cases, e.g. programs with stratified negation, even neces-sary to guarantee the semantics- to apply the rules in some order
Abstract interpretation and application to logic programs
, 1992
"... Abstract interpretation is a theory of semantics approximation which is usedfor the construction of semantics-basedprogram analysis algorithms (sometimes called“data flow analysis”), the comparison of formal semantics (e.g., construction of a denotational semantics from an operational one), the des ..."
Abstract
-
Cited by 317 (14 self)
- Add to MetaCart
standardoperational semantics formalizedas a transition system, classes of program properties are first encapsulatedin collecting semantics expressedas fixpoints on partial orders representing concrete program properties. We consider invariance properties characterizing the descendant states of the initial states
An Effective Bottom-Up Semantics for First-Order Linear Logic Programs
, 2001
"... We study the connection between algorithmic techniques for symbolic model checking [ACJT96,FS98,AJ99], and declarative and operational aspects of linear logic programming [And92,AP90]. Specically, we show that the construction used to decide verification problems for Timed Petri Nets [AJ99] can ..."
Abstract
- Add to MetaCart
] can be used to define a new fixpoint semantics for the fragment of linear logic called LO [AP90]. The fixpoint semantics is based on an effective TP operator. As an alternative to traditional topdown approaches [And92,AP90,APC93], the effective xpoint operator can be used to define a bottom-up
[Mathematical Logic and Formal Languages] Mathematical Logic—computability theory
"... We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives polynomial-time evaluation strategies for a large variety of rule sets th ..."
Abstract
- Add to MetaCart
We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives polynomial-time evaluation strategies for a large variety of rule sets
Model Checking Linear Logic Specifications
, 2003
"... The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi 1 ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
; Cervesato 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al. 2002). Following this line of research, we define here a general framework for the bottom-up evaluation of first order linear
TWO SEMANTICS FOR TEMPORAL ANNOTATED CONSTRAINT LOGIC PROGRAMMING
"... We investigate the semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms. TAC ..."
Abstract
- Add to MetaCart
. TACLP is given two different kinds of semantics, an operational one based on meta-logic (top-down semantics) and a fixpoint one based on an immediate consequence operator (bottom-up semantics). 1 Introduction Temporal reasoning is at the heart of human activity and not surprisingly it has raised a lot
Verification of Description Logic Knowledge and Action Bases
, 2012
"... doi:10.3233/978-1-61499-098-7-103 ..."
Free Theorems in the Presence of seq
, 2004
"... Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. Unfortunately, the standard parametricity theorem fails for nonstrict languages supporting a polymorph ..."
Abstract
-
Cited by 39 (12 self)
- Add to MetaCart
polymorphic strict evaluation primitive like Haskell's $\mathit{seq}$. Contrary to the folklore surrounding $\mathit{seq}$ and parametricity, we show that not even quantifying only over strict and bottom-reflecting relations in the $\forall$-clause of the underlying logical relation --- and thus
Results 1 - 10
of
116
