Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Time Capsule Discourse, E. Hughes Shanks Nov 2004

Time Capsule Discourse, E. Hughes Shanks

History Faculty Proceedings & Presentations

The purpose of this presentation is to encourage participants to develop a deeper sensitivity toward different perceptions of historical events. Attendees will participate in a forum that invites free expression of cultural values, and encourages participants to keep an open mind when encountering values and perspectives different from their own.


A Sat-Based Polynomial Space Algorithm For Answer Set Programming, Enrico Giunchiglia, Marco Maratea, Yuliya Lierler Jan 2004

A Sat-Based Polynomial Space Algorithm For Answer Set Programming, Enrico Giunchiglia, Marco Maratea, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems.

In this paper we present a SAT-Based decision procedure for …