Filters








401,090 Hits in 5.0 sec

Set Constraints and Logic Programming

Dexter Kozen
1998 Information and Computation  
In this paper we describe a constraint logic programming language clp(sc) over set constraints in the style of Ja ar and Lassez 17].  ...  The language subsumes ordinary logic programs over an Herbrand domain. We g i v e an e cient uni cation algorithm and operational, declarative, and xpoint s e m a n tics.  ...  The proofs are standard, using results and techniques of logic programming and constraint logic programming 17].  ... 
doi:10.1006/inco.1997.2694 fatcat:vemmnq3chrdyrgvtdhg6kd5pny

Sets and constraint logic programming

Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi
2000 ACM Transactions on Programming Languages and Systems  
In this paper we present a Constraint Logic Programming (CLP) language which provides nite sets|along with basic set-theoretic operations|as rst-class objects of the language.  ...  We also review and compare the main techniques considered to represent nite sets in logic languages, and we give, trough programming examples, the taste of the expressive power o ered by programming in  ...  The interpreter of the language CLP(SET ), written in SICStus Prolog, is available at http://www.math.unipr.it/ gianfr/setlog.Home.html.  ... 
doi:10.1145/365151.365169 fatcat:a7mjs54f4jgxbpjk5awykkv7wq

Integrating answer set programming and constraint logic programming

Veena S. Mellarkod, Michael Gelfond, Yuanlin Zhang
2008 Annals of Mathematics and Artificial Intelligence  
The algorithm does not require full grounding of a program and combines "classical" ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction.  ...  We belief that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set  ...  Acknowledgments This work was supported in part by NASA contract NASA-NEG05GP48G and ATEE/DTO contract ASU-06-C-0143.  ... 
doi:10.1007/s10472-009-9116-y fatcat:c2kkop4fobahxbiy2kbrbsjs6m

Adding partial functions to Constraint Logic Programming with sets

MAXIMILIANO CRISTIÁ, GIANFRANCO ROSSI, CLAUDIA FRYDMAN
2015 Theory and Practice of Logic Programming  
In this paper we propose to add partial functions as a primitive feature to a Constraint Logic Programming (CLP) language, namely {log}.  ...  Although partial functions could be programmed on top of {log}, providing them as first-class citizens adds valuable flexibility and generality to the form of set-theoretic formulas that the language can  ...  {log} {log} is a Constraint Logic Programming (CLP) language, whose constraint domain is that of hereditarily finite sets-i.e., finitely nested sets that are finite at each level of nesting.  ... 
doi:10.1017/s1471068415000290 fatcat:5tb7tm3mgbc65cmsrkbrch2e4q

Learning weak constraints in answer set programming

MARK LAW, ALESSANDRA RUSSO, KRYSIA BRODA
2015 Theory and Practice of Logic Programming  
AbstractThis paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set Programming (ASP).  ...  The framework, calledLearning from Ordered Answer Sets, generalises our previous work on learning ASP programs without weak constraints, by considering a new notion of examples asorderedpairs of partial  ...  A program P is assumed to be a finite set of normal rules, choice rules, and constraints.  ... 
doi:10.1017/s1471068415000198 fatcat:55kq5ocp6zcadkrtaxftqgx5sq

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs [chapter]

Andreas Podelski, Witold Charatonik, Martin Müller
1999 Lecture Notes in Computer Science  
Our technical contributions are (1) the semantical characterization of finite failure of logic programs over infinite trees and (2) the design and soundness proof of the first set-based analysis of logic  ...  This paper presents the first approximation method of the finite-failure set of a logic program by set-based analysis.  ...  approximate the success set of a logic program.  ... 
doi:10.1007/3-540-49099-x_12 fatcat:2qubf6bu55gelntsq4ikaoyxki

Constraint logic programming over sets of spatial objects

Jesús M. Almendros-Jiménez
2005 Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming - WCFLP '05  
Constraint Logic Programming (CLP) is a framework integrating Constraint Programming (CP) and Logic Programming (LP).  ...  CLP is described as a general schema of combination of logic-based languages and constraint solvers.  ...  Acknowledgments This work has been partially supported by the Spanish project of the Ministry of Science and Technology, "INDALOG" TIC2002-03968 under FEDER funds.  ... 
doi:10.1145/1085099.1085106 dblp:conf/wcflp/Almendros-Jimenez05 fatcat:luokvuiy5ngf7f76yznrxiy7di

ASP (): Answer Set Programming with Algebraic Constraints

THOMAS EITER, RAFAEL KIESEL
2020 Theory and Practice of Logic Programming  
Using a novel combination of Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based on intuitionistic grounds, we introduce Answer Set Programming with Algebraic Constraints (ASP  ...  Such constraints provide streamlined access to a manifold of constructs available in ASP, like aggregates, choice constraints, and arithmetic operators.  ...  This work has been supported by FWF project W1255-N23 and by FFG project 861263.  ... 
doi:10.1017/s1471068420000393 fatcat:havbpg5bcbfefoaurzksggd7ce

Constraint Answer Set Programming without Grounding

JOAQUIN ARIAS, MANUEL CARRO, ELMER SALAZAR, KYLE MARPLE, GOPAL GUPTA
2018 Theory and Practice of Logic Programming  
In this paper we propose to incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements ASP while retaining logical variables both during execution and in the answer  ...  sets.  ...  The s(ASP) Predicate Answer Set Programming System. The Association for Logic Programming Newsletter. MARPLE, K., SALAZAR, E., AND GUPTA, G. 2017b.  ... 
doi:10.1017/s1471068418000285 fatcat:d4nidtldyfbq7c6dvpvvx533nq

Tractable answer-set programming with weight constraints: bounded treewidth is not enough

REINHARD PICHLER, STEFAN RÜMMELE, STEFAN SZEIDER, STEFAN WOLTRAN
2012 Theory and Practice of Logic Programming  
AbstractCardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming.  ...  The goal of this paper is to apply the notion of treewidth to programs with cardinality or weight constraints and to identify tractable fragments.  ...  A program with weight constraints (PWC) is a triple Π = (A, C, R), where A is a set of atoms, C is a set of weight constraints (or constraints for short), and R is a set of rules.  ... 
doi:10.1017/s1471068412000099 fatcat:ofmtz5hjwzb67pwbgrd5hogbmy

A translational approach to constraint answer set solving

CHRISTIAN DRESCHER, TOBY WALSH
2010 Theory and Practice of Logic Programming  
AbstractWe present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP.  ...  We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency.  ...  Acknowledgements NICTA is funded by the Department of Broadband, Communications and the Digital Economy, and the Australian Research Council.  ... 
doi:10.1017/s1471068410000220 fatcat:gtt2kevvuvfi7knbgmje2fwz7y

Business process verification with constraint temporal answer set programming

LAURA GIORDANO, ALBERTO MARTELLI, MATTEO SPIOTTA, DANIELE THESEIDER DUPRÉ
2013 Theory and Practice of Logic Programming  
AbstractThe paper provides a framework for the verification of business processes, based on an extension of answer set programming (ASP) with temporal logic and constraints.  ...  Verification of temporal properties of a business process, including verification of compliance to business rules, is performed by bounded model checking techniques in Answer Set Programming, extended  ...  Goal Exploiting Computational Logic for modeling Business Processes and verifying their compliance with business rules and norms Constraint Temporal Answer Set Programming combines Constraint ASP with  ... 
doi:10.1017/s1471068413000409 fatcat:oahjxhewuvc7rf5gqfkl7tlibe

Constraint answer set solver EZCSP and why integration schemas matter

MARCELLO BALDUCCINI, YULIYA LIERLER
2017 Theory and Practice of Logic Programming  
Researchers in answer set programming and constraint programming have spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally  ...  These efforts resulted in a new research area: constraint answer set programming.  ...  To begin, we defined logic programs with constraint atoms (CA programs).  ... 
doi:10.1017/s1471068417000102 fatcat:glzal4l6fzgu7fai5ywat5krry

An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

Agostino Dovier, Andrea Formisano, Enrico Pontelli
2009 Journal of experimental and theoretical artificial intelligence (Print)  
This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Programming over finite  ...  The objective is to investigate how the solvers in the two domains respond to different problems, highlighting strengths and weaknesses of their implementations and suggesting criteria for choosing one  ...  This work is partially supported by MIUR-PRIN project n.2005-015491, GNCS2005 project on constraints and their applications, and by NSF grants CNS-0220590, CNS-0454066, and HRD-0420407.  ... 
doi:10.1080/09528130701538174 fatcat:rrqurqkkujet3kln56gg5edaqe

A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints

Sean Policarpio, Yan Zhang
2011 International Journal of Secure Software Engineering  
The language, A xml(T ) , allows for the specification of authorisations on XML documents and distinguishes itself from other research with the inclusion of temporal interval reasoning and the XPath query  ...  Logic Program Translation With a completed policy base, we can translate all of the A xml(T ) rules into an A LP answer set program.  ...  Section 3 describes the semantics of language A xml(T ) based on its translation into a logic program under answer set semantics.  ... 
doi:10.4018/jsse.2011010102 fatcat:rfmaacmp6zdp7oobh2q56j6pay
« Previous Showing results 1 — 15 out of 401,090 results