Pseudo-stable Models for Logic Programs
نویسنده
چکیده
For a general logic program, a set of n+ 1 logic values is considered and an unde ned value denoted u. Partial multi-valued interpretations are also de ned. A general logic program P may contain the constants that are de ned for every logic value. A pseudo-negation denoted eh is de ned for every integer h, where 0 h < n. A partial ordering denoted h is de ned between multi-valued interpretations. Using an operator de ned for a program P , a multi-valued pseudo-stable semantics for the program P is introduced. The pseudo-stable models which satisfy certain properties are minimal elements of the set of all models for the program P having those properties. The class of pseudo-stable models for a program P contains strictly the class of 3-valued stable models for P .
منابع مشابه
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, pbmodels converts ground logic programs to propositional theories with weight atoms so that stable models correspond to models. Our approach is similar to that used by assat and cmodels. However, unlike these two systems, pbmod...
متن کاملLoop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computation by computing models of completion. One particular attractive candidate for the latter task is pseudo-boolean constraint solvers. To strengthen this connection, we show examples of compact encoding of aggregates and ...
متن کاملProperties and Applications of Programs with Monotone and Convex Constraints
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations, tight programs and Fages Lemma, program completion and loop formulas. Our results provide an abstract account of properties of some recent extensions of log...
متن کاملStable Generated Models of Generalized Constraint Logic Programs
We present a declarative semantics of generalized constraint logic programs based on stable generated models. Generalized logic programs contain arbitrary quantiier free formulas in the bodies and heads of their rules. Up to now the only declarative semantics for this program class is deened in terms of stable generated models introduced by Herre and Wagner. A generalized constraint logic progr...
متن کاملLogic Programs with Abstract Constraint Atoms
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is an abstract constraint (formally, a collection of sets of atoms). Atoms C(X) are satisfied by an interpretation (set of atoms) M , if M ∩ X ∈ C. We focus here on monotone constraints, that is, those collections C that are closed under...
متن کامل