Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
<i>aspps</i> — An Implementation of Answer-Set Programming with Propositional Schemata

aspps — An Implementation of Answer-Set Programming with Propositional Schemata

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 2173/2001
BookLogic Programming and Nonmotonic Reasoning
DOI10.1007/3-540-45402-0
Copyright2001
ISBN978-3-540-42593-9
DOI10.1007/3-540-45402-0_31
Pages402-405
Subject CollectionComputer Science
SpringerLink DateMonday, January 01, 2001
Add to marked items

aspps — An Implementation of Answer-Set Programming with Propositional Schemata

Deborah East4 and Mirosłlaw Truszczyński4

(4)  Department of Computer Science, University of Kentucky Lexington, KY, 40506-0046, USA
Abstract
We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). The system aspps is designed to process PS+- theories. It consists of two basic modules. The first module, psgrnd, grounds an PS+-theory. The second module, referred to as aspps, is a solver. It computes models of ground PS+-theories.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.107 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)