Using Criticalities as a Heuristic for Answer Set Programming

Date

2004-01-08

Author

SABUNCU, ORKUNT
Alpaslan, Ferda Nur
AKMAN, VAROL

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

222
views

0
downloads

Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the performance of the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS' usefulness.

Subject Keywords

Semantics

URI

https://hdl.handle.net/11511/55225

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A visual interactive approach for scenario-based stochastic multi-objective problems and an application Balibek, E.; Köksalan, Mustafa Murat (2012-12-01) In many practical applications of stochastic programming, discretization of continuous random variables in the form of a scenario tree is required. In this paper, we deal with the randomness in scenario generation and present a visual interactive method for scenario-based stochastic multi-objective problems. The method relies on multi-variate statistical analysis of solutions obtained from a multi-objective stochastic problem to construct joint confidence regions for the objective function values. The decis...
Computing cryptographic properties of Boolean functions from the algebraic normal orm representation Çalık, Çağdaş; Doğanaksoy, Ali; Department of Cryptography (2013) Boolean functions play an important role in the design and analysis of symmetric-key cryptosystems, as well as having applications in other fields such as coding theory. Boolean functions acting on large number of inputs introduces the problem of computing the cryptographic properties. Traditional methods of computing these properties involve transformations which require computation and memory resources exponential in the number of input variables. When the number of inputs is large, Boolean functions are ...
Multi–target implementation of a domain specific language for extended feature models Demirtaş, Görkem; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2018) Translation of feature models to constraint logic programs is an effective method to enable their automated analysis using existing constraint solvers. More flexibility can be offered for building and application of analysis operations on extended feature models by providing a syntax and mechanism for interfacing the host solver with user defined constraint predicates. These constraints, such as global constraints, can be provided by the constraint solver runtime or by the translator itself as a part of the...
The Influence of Pair Programming on Secondary School Students’ Confidence and Achievement in Computer Programming Çal, Habibe; Can, Gülfidan (2020-01-01) The purpose of this embedded case study is to explore the possible influence of pair programming on secondary school students’ confidence and achievement in computer programming. A total of 35 students in a fifth-grade class were divided into individual (n=13) and pair programmers (n=22), who then used Scratch programming activities during an eight week implementation. Qualitative data were collected with interviews and quantitative data were collected with a confidence questionnaire and rubrics. Content an...
Improving Hit Ratio of ILP-based Concept Discovery System with Memoization Mutlu, Alev; Karagöz, Pınar (2014-01-01) Although Inductive Logic Programming (ILP)-based concept discovery systems have applications in a wide range of domains, they still suffer from scalability and efficiency issues. One of the reasons for the efficiency problem is the high number of query executions necessary in the concept discovery process. Owing to the refinement operator of ILP-based concept discovery systems, these queries repeat frequently. In this work, we propose a method to improve the look-up table hit ratio for repeating queries of ...

Citation Formats

O. SABUNCU, F. N. Alpaslan, and V. AKMAN, “Using Criticalities as a Heuristic for Answer Set Programming,” 2004, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55225.