By A. Weinzierl, B. Bogaerts, J. Bomanson, T. Eiter, G. Friedrich, T. Janhunen, T. Kaminski, M. Langowski, L. Leutgeb, G. Schenner and R. Taupe Abstract. The grounding bottleneck is a longstanding issue of Answer Set Programming (ASP), a well-known Logic…
Category: Feature Articles
The SAT Compiler in Picat
By Neng-Fa Zhou (CUNY Brooklyn College & Graduate Center) Abstract SAT solvers’ performance has drastically improved during the past 20 years, thanks to the inventions of techniques from conflict-driven clause learning, backjumping, variable and value selection heuristics, to random restarts.…
PSOA RuleML Bridges Graph and Relational Databases
By Harold Boley University of New Brunswick, Fredericton, Canada ABSTRACT In PSOA RuleML, Graph Databases and Relational Databases are bridged conceptually, with interoperation paths through its metamodel of three orthogonal dimensions, as well as programmatically, with transition rules realized in…
Proving Program Correctness Using the AG Semantics: An Example with n-Queens
By Amelia Harrison UT Austin, USA ABSTRACT We show an example of how the proposal for the semantics of the subset of the input language of gringo called AG can be used as the basis for a proof of correctness of a…
DLV: Evolution and Perspectives
DLV is a system for Answer Set Programming (ASP), a logic-based programming paradigm for solving problems in a fully declarative way. It has been one of the first solid and reliable ASP systems, widely used in academy and fruitfully employed in many relevant industrial applications. In this paper …
Energy Consumption Analysis and Verification using CiaoPP
By P. Lopez-Garcia, M. Hermenegildo, M. Klemen and U. Liqat
IMDEA Software Institute
Spain
About negation-as-failure and the informal semantics of Logic Programming
By M. Denecker, M. Truszczynski, J. Vennekens
In Search of the Perfect Musical Scale
By John Hooker
Carnegie Mellon University
USA
The s(ASP) Predicate Answer Set Programming System
By Kyle Marple, Elmer Salazar Zhuo Chen, and Gopal Gupta Department of Computer Science The University of Texas at Dallas Abstract: We present the s(ASP) system that computes stable models of normal logic programs, i.e., logic programs extended with…
On the Relationship Between Ontology-mediated Queries and Non-monotonic Datalog
By Shqiponja Ahmetaj, Magdalena Ortiz, and Mantas Šimkus. Institute of Information Systems, TU Vienna, Austria