Computing Stable Models of Logic Programs Using Metropolis Algorithm
نویسندگان
چکیده
This article introduces a novel Monte Carlo type algorithm, which we call the Metropolized Forward Chaining (MFC) algorithm, to find a stable model of a general propositional logic program P if P has a stable model or to find a maximal subprogram P ′ of P and stable model M ′ of P ′ if P does not have a stable model. Our algorithm combines the forward chaining algorithm of Marek, Nerode, and Remmel with the Metropolis algorithm. To demonstrate the feasibility of MFC, we conducted computer experiments on randomly generated logic programs and on logic programs to find (2,6) van der Waerden’s certificates.
منابع مشابه
Extensions of Answer Set Programming
This paper describes a doctoral research in three areas: Hybrid ASP – an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms. The paper discusses a possible application of all three areas to the problem of maximizing total expect...
متن کاملStochastic Logic Programs: Sampling, Inference and Applications
Algorithms for exact and approximate inference in stochastic logic programs (SLPs) are pre sented, based respectively, on variable elimina tion and importance sampling. We then show how SLPs can be used to represent prior distri butions for machine learning, using (i) logic pro grams and (ii) Bayes net structures as examples. Drawing on existing work in statistics, we apply the Metropolis-H...
متن کاملEfficient Implementation of the Stable Model Semantics for Normal Logic Programs
The aim of this work is to develop an eecient implementation method of the stable model semantics of logic programs with negation using as a basis a lately proposed decision procedure for Reiter's default logic. The problem of nding a stable model of a logic program is NP-complete. An algorithm for computing the stable model semantics of propositional logic programs is presented. The time compl...
متن کاملDisjunctive Stable Models : Unfounded Sets
Disjunctive logic programs have become a powerful tool in knowledge representation and commonsense reasoning. This paper focuses on stable model semantics, currently the most widely acknowledged semantics for disjunctive logic programs. After presenting a new notion of unfounded sets for disjunctive logic programs, we provide two declarative characterizations of stable models in terms of unfoun...
متن کاملComputing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stable models of logic programs are closely connected to stable expansions of a class of autoepistemic theories, this algorithm points to a link between stable expansions of a class of autoepistemic theories and ATMS struct...
متن کامل