Results 1  10
of
573
Alternating fixed points in boolean equation systems as preferred stable models
 In ICLP 2001
, 2001
"... Abstract. We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To precisely capture this relationship, we introduce the notion of a preferred stable model of a logic program, and define a mapping that associates a normal l ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To precisely capture this relationship, we introduce the notion of a preferred stable model of a logic program, and define a mapping that associates a normal
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. That is, we replaced the reference to >.� ) in and similarly for 11"�) in Equation 3, where 0 :::; J.l :::; 1 is the momentum term. It is easy to show that if the modified system of equations converges to a fixed point F, then F is also a fixed point of the original system (since if>.� ) = >
Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points
, 2003
"... This paper presents a technique for the resolution of alternating disjunctive/conjunctive boolean equation systems. The technique can be used to solve various verification problems on finitestate concurrent systems, by encoding the problems as boolean equation systems and determining their local so ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
of alternation free variables occurring in the equation system and n the number of alternating variables. We found that many calculus formulas with alternating fixed points occurring in the literature can be encoded as boolean equation systems of disjunctive/conjunctive forms. Practical experiments show that we
Solving Alternating Boolean Equation Systems in Answer Set Programming
"... Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive and conjunctive Boolean equation systems. Based on this we devise a mapping from Boolean equation systems with alternat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
with alternating fixed points to normal logic programs such that the solution of a given variable of an equation system can be determined by the existence of a stable model of the corresponding logic program. The technique can be used to model check alternating formulas of modal µcalculus. 1
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model (Extended Abstract)
, 1989
"... 1 Introduction The perfect model semantics [ABW88, VG89b, Prz88a, Prz89b] provides an attractive alternative to the traditionally used semantics of logic programs based on Clark's completion of the program [Cla78, Llo84, Fit85, Kun87]. Perfect models are minimal models of the program, which ca ..."
Abstract

Cited by 156 (13 self)
 Add to MetaCart
can be equivalently described as iterated least fixed points of natural operators [ABW88, VG89b], as iterated least models of the program [ABW88, VG89b] or as preferred models with respect to a natural priority relation [Prz88a, Prz89b]. As a result, the perfect model semantics is not only very
Fully Local and Efficient Evaluation of Alternating Fixed Points
, 1998
"... We introduce Partitioned Dependency Graphs (PDGs), an abstract framework for the specification and evaluation of arbitrarily nested alternating fixed points. The generality of PDGs subsumes that of similarly proposed models of nested fixedpoint computation such as Boolean graphs, Boolean equation s ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
We introduce Partitioned Dependency Graphs (PDGs), an abstract framework for the specification and evaluation of arbitrarily nested alternating fixed points. The generality of PDGs subsumes that of similarly proposed models of nested fixedpoint computation such as Boolean graphs, Boolean equation
AN ALGORITHM FOR DETECTING FIXED POINTS OF BOOLEAN NETWORKS
"... Abstract. In the applications of Boolean networks to modeling biological systems, an important computational problem is the detection of the fixed points of these networks. This is an NPcomplete problem in general. There have been various attempts to develop algorithms to address the computation ne ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In the applications of Boolean networks to modeling biological systems, an important computational problem is the detection of the fixed points of these networks. This is an NPcomplete problem in general. There have been various attempts to develop algorithms to address the computation
A LinearTime ModelChecking Algorithm for the AlternationFree Modal MuCalculus
 Formal Methods in System Design
, 1993
"... We develop a modelchecking algorithm for a logic that permits propositions to be defined using greatest and least fixed points of mutually recursive systems of equations. This logic is as expressive as the alternationfree fragment of the modal mucalculus identified by Emerson and Lei, and it may ..."
Abstract

Cited by 134 (15 self)
 Add to MetaCart
We develop a modelchecking algorithm for a logic that permits propositions to be defined using greatest and least fixed points of mutually recursive systems of equations. This logic is as expressive as the alternationfree fragment of the modal mucalculus identified by Emerson and Lei, and it may
Efficient Model Checking Using Tabled Resolution
 Computer Aided Verification (CAV '97)
, 1997
"... We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixedpoint engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCSlike valuepassing language and the alternationfree fragmen ..."
Abstract

Cited by 131 (36 self)
 Add to MetaCart
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixedpoint engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCSlike valuepassing language and the alternation
Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation
 In Proceedings of the Conference on Uncertainty in Artificial Intelligence
, 2001
"... We present a novel inference algorithm for arbitrary, binary, undirected graphs.Unlike loopy belief propagation, which iterates fixed point equations, we directly descend on the Bethe free energy. The algorithm consists of two phases,first we update the pairwise probabilities, given the marginal pro ..."
Abstract

Cited by 63 (6 self)
 Add to MetaCart
We present a novel inference algorithm for arbitrary, binary, undirected graphs.Unlike loopy belief propagation, which iterates fixed point equations, we directly descend on the Bethe free energy. The algorithm consists of two phases,first we update the pairwise probabilities, given the marginal
Results 1  10
of
573