Sciweavers

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

18

AAAI
1990

favoriteEmaildiscussreport

170views Intelligent Agents» more AAAI 1990»

Computing Stable Models by Using the ATMS

13 years 5 months ago

Computing Stable Models by Using the ATMS

Download www.aaai.org

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 structures

Kave Eshghi

Real-time Traffic

AAAI 1990 | Intelligent Agents | Logic Programs | Stable Expansions | Stable Models |

claim paper

Related Content

» Static priority scheduling for ATM networks

» Possibilistic Stable Model Computing

» Optimal Feedback Control for ABR Service in ATM

» Pbmodels Software to Compute Stable Models by Pseudoboolean Solvers

» Integrated Rate and Credit Feedback Control for ABR Service in ATM Networks

» A Rate Allocation Policy with MCRPCR Support and Distributed ABR Implementation Using Expl...

» Stable models and difference logic

» Interconnection of FDDIII networks through an ATM backbone An analysis

» Bounded LTL Model Checking with Stable Models

Post Info
More Details (n/a)

Added	06 Nov 2010
Updated	06 Nov 2010
Type	Conference
Year	1990
Where	AAAI
Authors	Kave Eshghi

Comments (0)