Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Networks - Ii: A Survey Of Data Management Issues & Frameworks For Mobile Ad Hoc Networks, Noman Islam, Zubair A. Shaikh
Networks - Ii: A Survey Of Data Management Issues & Frameworks For Mobile Ad Hoc Networks, Noman Islam, Zubair A. Shaikh
International Conference on Information and Communication Technologies
Data Management is the execution of a pool of activities on a set of data to conform to the end user data requisitions. MANET is an emerging discipline of computer networks in which a group of roaming hosts spontaneously establishes the network among themselves. The employment of data management in MANET can engender a number of useful applications. However, data management in MANET is a taxing job as it requires deliberation on a number of research issues (e.g. knowledge representation, knowledge discovery, caching, and security etc.). This paper provides a detailed account of the data management problem and its issues, …
Weighted-Sequence Problem: Asp Vs Casp And Declarative Vs Problem-Oriented Solving, Yuliya Lierler, Shaden Smith, Miroslaw Truszczyński, Alex Westlund
Weighted-Sequence Problem: Asp Vs Casp And Declarative Vs Problem-Oriented Solving, Yuliya Lierler, Shaden Smith, Miroslaw Truszczyński, Alex Westlund
Computer Science Faculty Proceedings & Presentations
Search problems with large variable domains pose a challenge to current answer-set programming (ASP) systems as large variable domains make grounding take a long time, and lead to large ground theories that may make solving infeasible. To circumvent the “grounding bottleneck” researchers proposed to integrate constraint solving techniques with ASP in an approach called constraint ASP (CASP). In the paper, we evaluate an ASP system CLINGO and a CASP system CLINGCON on a handcrafted problem involving large integer domains that is patterned after the database task of determining the optimal join order. We find that search methods used by CLINGO …
A Transition System For Ac Language Algorithms, Yuliya Lierler, Yaunlin Zhang
A Transition System For Ac Language Algorithms, Yuliya Lierler, Yaunlin Zhang
Computer Science Faculty Proceedings & Presentations
Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. In a similar vein, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. A distinguishing feature of these languages is their capacity to allow new efficient inference algorithms that combine traditional ASP procedures and other efficient methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) can be extended to model the “hybrid” ACSOLVER algorithm, by Mellarkod et al., designed for processing a …
Asp-Based Problem Solving With Cutting-Edge Tools, Marcello Balduccini, Yuliya Lierler
Asp-Based Problem Solving With Cutting-Edge Tools, Marcello Balduccini, Yuliya Lierler
Computer Science Faculty Proceedings & Presentations
In the development of practical applications of answer set programming (ASP), encodings that use well-established solvers such as CLASP and DLV are sometimes affected by scalability issues. In those situations, one can resort to more sophisticated ASP tools exploiting, for instance, incremental and constraint ASP. However, today there is no specific methodology for the selection or use of such tools. In this paper we describe how we used such cutting-edge ASP tools on challenging problems from the Third Answer Set Programming Competition, and outline the methodology we followed. We view this paper as a first step in the development of …
On Simple But Hard Random Instances Of Propositional Theories And Logic Programs, Gayathri Namasivayam
On Simple But Hard Random Instances Of Propositional Theories And Logic Programs, Gayathri Namasivayam
University of Kentucky Doctoral Dissertations
In the last decade, Answer Set Programming (ASP) and Satisfiability (SAT) have been used to solve combinatorial search problems and practical applications in which they arise. In each of these formalisms, a tool called a solver is used to solve problems. A solver takes as input a specification of the problem – a logic program in the case of ASP, and a CNF theory for SAT – and produces as output a solution to the problem. Designing fast solvers is important for the success of this general-purpose approach to solving search problems. Classes of instances that pose challenges to solvers …