• Home
  • Search
  • Answer set programming : SAT based solver and phase transition
  • https://doi.org/10.14711/thesis-b810483Copy DOI Icon

Answer set programming : SAT based solver and phase transition

  • Jan 1, 2003
  • Yuting Zhao
Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

Answer Set Programming (ASP) is a constraint-based programming paradigm proposed recently by AI researchers. In this paradigm one solves a problem by encoding constraints as logic program rules in such a way that the solutions to the original problem correspond to the so-called answer sets of the logic program. This new programming paradigm has found applications in problems ranging from combinatorial search problems, such as the graph coloring and Hamiltonian circuit problems, to product configuration and data encryption problems. In this dissertation, we make the following two contributions to the new programming paradigm ASP. First, we propose and implement a new ASP system using traditional SAT (propositional satisfiability) solvers. This is done by a translation from logic programs to sets of clauses in propositional logic. Our experimental results show that for many benchmark domains, our system performs better than existing specialized ASP systems. Secondly, we study the phase transition phenomenon in randomly generated logic programs, and identify a region in a class of randomly generated logic programs where the logic programs are hard for all existing ASP systems.

Similar Papers
  • Book Chapter
  • Citations28

Planning in Answer Set Programming Using Ordered Task Decomposition

  • Jan 01, 2003
  • Jürgen Dix +2
  • Research Article
  • Citations1

An Answer Set Programming System with Cycle Breaking Heuristic

  • Mar 25, 2010
  • Journal of Software
  • Yu-Ping Shen +1
  • Single Book
  • Citations20

Logic Programming and Nonmonotonic Reasoning

  • Jan 01, 2009
  • Esra Erdem +2
  • Research Article
  • Citations3

Complexity of super-coherence problems in ASP

  • Aug 09, 2013
  • Theory and Practice of Logic Programming
  • Mario Alviano +2
  • Research Article
  • Citations15

Multi-engine ASP solving with policy adaptation

  • Dec 11, 2013
  • Journal of Logic and Computation
  • M Maratea +2
  • Conference Article
  • Citations9

Blending Grounding and Compilation for Efficient ASP Solving

  • Nov 01, 2024
  • Carmine Dodaro +2
  • Research Article
  • Citations10

ApproxASP – a Scalable Approximate Answer Set Counter

  • Jun 28, 2022
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Mohimenul Kabir +5
  • Research Article
  • Citations459

ASSAT: computing answer sets of a logic program by SAT solvers

  • Jun 05, 2004
  • Artificial Intelligence
  • Fangzhen Lin +1
  • Book Chapter
  • Citations6

Writing Declarative Specifications for Clauses

  • Jan 01, 2016
  • Martin Gebser +4
  • Research Article
  • Citations7

Witnesses for Answer Sets of Logic Programs

  • Jan 27, 2023
  • ACM Transactions on Computational Logic
  • Yisong Wang +3
  • Research Article
  • Citations12

Automated Verification of Weak Equivalence within thesmodelsSystem

  • Nov 01, 2007
  • Theory and Practice of Logic Programming
  • Tomi Janhunen +1
  • Book Chapter
  • Citations1

Moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming

  • Jan 01, 2017
  • Orkunt Sabuncu +1
  • Book Chapter
  • Citations30

Improving the Normalization of Weight Rules in Answer Set Programs

  • Jan 01, 2014
  • Jori Bomanson +2
  • Conference Article

Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems

  • May 01, 2011
  • Ilkka Niemelä
  • PDF
  • Research Article
  • Citations58

The Sixth Answer Set Programming Competition

  • Sep 13, 2017
  • Journal of Artificial Intelligence Research
  • Martin Gebser +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.