Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

LANMR
2007

favoriteEmaildiscussreport

100views Logical Reasoning» more LANMR 2007»

Generating maximal models using the stable model semantics

13 years 5 months ago

Generating maximal models using the stable model semantics

Download sunsite.informatik.rwth-aachen.de

Given a propositional formula X, we present a mapping that constructs a general program P, such that the maximal models of X correspond to the stable models of P, after intersecting each stable model with the relevant atoms. Maximal models are of interest for dierent applications.

Juan Carlos Nieves, Mauricio Osorio

Real-time Traffic

LANMR 2007 | Logical Reasoning | Maximal Models | Propositional Formula X | Stable Model |

claim paper

Related Content

» Level Mapping Characterizations of Selector Generated Models for Logic Programs

» Stable Models and NonDeterminism in Logic Programs with Negation

» Maximally Stable Colour Regions for Recognition and Matching

» Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm

» Stable Semantics of Temporal Deductive Databases

» Equivalence for the G3stable models semantics

» Possibilistic Stable Model Computing

» Uniform Equivalence of Logic Programs under the Stable Model Semantics

» Bounded LTL Model Checking with Stable Models

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2007
Where	LANMR
Authors	Juan Carlos Nieves, Mauricio Osorio

Comments (0)