• Home
  • Search
  • A scale-free model for random ASP programs
  • https://doi.org/10.1142/9789813273238_0109Copy DOI Icon

A scale-free model for random ASP programs

  • Abstract
  • Literature Map
  • Similar Papers
Abstract

Scale-free property, which means a small number of nodes dominate a network with far more number of connections than other nodes, has been observed in many large-scale real-world networks and many large software systems. However, this is not investigated for answer set programming (ASP), a major paradigm of declarative problem solving. This paper first presents a generator (model) for randomly generating ASP programs that demonstrate scale-free property. Then reports that all the 28 real ASP programs from different domain showing clear scale-free property. Finally significant experiments are conducted to demonstrate that random generated ASP programs could be solved in polynomial time if they are scale-free, while general random ASP programs are NP hard problems. The results may help to understand the nature of large ASP programs.

Similar Papers
  • 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
  • Citations5

A Machine Learning guided Rewriting Approach for ASP Logic Programs

  • Sep 19, 2020
  • Electronic Proceedings in Theoretical Computer Science
  • Elena Mastria +3
  • Research Article
  • Citations8

Compilation of Aggregates in ASP Systems

  • Jun 28, 2022
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Giuseppe Mazzotta +2
  • Conference Article
  • Citations3

First-order ASP programs as CHR programs

  • Mar 22, 2021
  • Igor Stéphan
  • Research Article

Intrinsic Prioritization in Answer Set Programming Based on an Adapted Notion of Tolerance

  • May 13, 2024
  • The International FLAIRS Conference Proceedings
  • Marco Wilhelm +2
  • Conference Article
  • Citations1

Sketched Answer Set Programming

  • Nov 01, 2018
  • Sergey Paramonov +3
  • Book Chapter
  • Citations5

Modular Answer Set Programming

  • Sep 08, 2007
  • Emilia Oikarinen
  • Book Chapter
  • Citations11

Answer Set Programming: A Declarative Approach to Solving Search Problems

  • Jan 01, 2006
  • Ilkka Niemelä
  • Book Chapter
  • Citations21

Unit Testing in ASPIDE

  • Jan 01, 2013
  • Onofrio Febbraro +3
  • Conference Article
  • Citations2

LLASP: Fine-tuning Large Language Models for Answer Set Programming

  • Nov 01, 2024
  • Erica Coppolillo +4
  • Research Article

Repairing Access Control Configurations via Answer Set Programming

  • Nov 01, 2011
  • Qatar Foundation Annual Research Forum Proceedings
  • Khaled Mohammed Khan
  • Research Article
  • Citations1

On the Strong Equivalences of LPMLN Programs

  • Sep 19, 2019
  • Electronic Proceedings in Theoretical Computer Science
  • Bin Wang +3
  • Research Article
  • Citations9

ASP and subset minimality: Enumeration, cautious reasoning and MUSes

  • Apr 20, 2023
  • Artificial Intelligence
  • Mario Alviano +4
  • Research Article
  • Citations10

ApproxASP – a Scalable Approximate Answer Set Counter

  • Jun 28, 2022
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Mohimenul Kabir +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.