Log in

Relevant bibliographies by topics / Declarative programming / Journal articles

To see the other types of publications on this topic, follow the link: Declarative programming.

Journal articles on the topic 'Declarative programming'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Declarative programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Crossley, John N. "Declarative programming." Electronic Notes in Theoretical Computer Science 61 (January 2002): 20. http://dx.doi.org/10.1016/s1571-0661(04)00302-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Arjun, Singh Saud, and Shrestha Tenish. "Template based Program synthesis with Declarative Programming for RESTful APIs." Recent Trends in Cloud Computing and Web Engineering 7, no. 1 (2024): 10–20. https://doi.org/10.5281/zenodo.13883634.

Full text

Abstract:

<em>This research delves into the intersection of declarative programming and template-based program synthesis, with a specific focus on their application in the context of RESTful APIs. RESTful APIs are integral to modern web development, demanding efficient and error-free design. Declarative programming offers an innovative approach to simplify the intricacies of API development, while template-based synthesis provides a structured methodology for API design. The research commences by exploring the foundational concepts of declarative programming, emphasizing the use of high-level abstractio

APA, Harvard, Vancouver, ISO, and other styles

3

BáRány, Vince, Balder Ten Cate, Benny Kimelfeld, Dan Olteanu, and Zografoula Vagena. "Declarative Probabilistic Programming with Datalog." ACM Transactions on Database Systems 42, no. 4 (2017): 1–35. http://dx.doi.org/10.1145/3132700.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hanus, Michael. "Reduction Strategies for Declarative Programming." Electronic Notes in Theoretical Computer Science 57 (December 2001): 184–91. http://dx.doi.org/10.1016/s1571-0661(04)00273-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Komorowski, Henryk Jan. "A declarative logic programming environment." Journal of Systems and Software 8, no. 2 (1988): 77–89. http://dx.doi.org/10.1016/0164-1212(88)90002-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lloyd, J. W., and K. S. Ng. "Declarative programming for agent applications." Autonomous Agents and Multi-Agent Systems 23, no. 2 (2010): 224–72. http://dx.doi.org/10.1007/s10458-010-9138-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Schor, Marshall I. "Declarative Knowledge Programming: Better Than Procedural?" IEEE Expert 1, no. 1 (1986): 36–43. http://dx.doi.org/10.1109/mex.1986.5006497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Louridas, Panagiotis. "Declarative GUI Programming in Microsoft Windows." IEEE Software 24, no. 4 (2007): 16–19. http://dx.doi.org/10.1109/ms.2007.105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lloyd, John W. "Declarative programming for artificial intelligence applications." ACM SIGPLAN Notices 42, no. 9 (2007): 123–24. http://dx.doi.org/10.1145/1291220.1291152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Finkelstein, Stacy E., Peter Freyd, and James Lipton. "A new framework for declarative programming." Theoretical Computer Science 300, no. 1-3 (2003): 91–160. http://dx.doi.org/10.1016/s0304-3975(01)00308-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Echahed, Rachid, and Wendelin Serwe. "Defining Actions in Concurrent Declarative Programming." Electronic Notes in Theoretical Computer Science 64 (September 2002): 176–94. http://dx.doi.org/10.1016/s1571-0661(04)80350-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

HOFSTEDT, PETRA, and PETER PEPPER. "Integration of declarative and constraint programming." Theory and Practice of Logic Programming 7, no. 1-2 (2007): 93–121. http://dx.doi.org/10.1017/s1471068406002833.

Full text

Abstract:

AbstractCombining a set of existing constraint solvers into an integrated system of cooperating solvers is a useful and economic principle to solve hybrid constraint problems. In this paper we show that this approach can also be used to integrate different language paradigms into a unified framework. Furthermore, we study the syntactic, semantic and operational impacts of this idea for the amalgamation of declarative and constraint programming.

APA, Harvard, Vancouver, ISO, and other styles

13

Chen, Adam, Parisa Fathololumi, Eric Koskinen, and Jared Pincus. "Veracity: declarative multicore programming with commutativity." Proceedings of the ACM on Programming Languages 6, OOPSLA2 (2022): 1726–56. http://dx.doi.org/10.1145/3563349.

Full text

Abstract:

There is an ongoing effort to provide programming abstractions that ease the burden of exploiting multicore hardware. Many programming abstractions ( e.g. , concurrent objects, transactional memory, etc.) simplify matters, but still involve intricate engineering. We argue that some difficulty of multicore programming can be meliorated through a declarative programming style in which programmers directly express the independence of fragments of sequential programs. In our proposed paradigm, programmers write programs in a familiar, sequential manner, with the added ability to explicitly express

APA, Harvard, Vancouver, ISO, and other styles

14

Hewett, Rattikorn, Phongphun Kijsanayothin, Stephanie Bak, and Marry Galbrei. "Cybersecurity policy verification with declarative programming." Applied Intelligence 45, no. 1 (2016): 83–95. http://dx.doi.org/10.1007/s10489-015-0749-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Guns, Tias. "Declarative pattern mining using constraint programming." Constraints 20, no. 4 (2015): 492–93. http://dx.doi.org/10.1007/s10601-015-9220-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Chen, Adam, Parisa Fathololumi, Eric Koskinen, and Jared Pincus. "Veracity: Declarative Multicore Programming with Commutativity." PACMPL 6, no. 10 (2022): 186:1–186:31. https://doi.org/10.5281/zenodo.7058421.

Full text

Abstract:

Veracity is a c-like language that features the commute statement, which can describe conditional commutativity of sequential code. When such code's commutativity condition is satisfied, and proper (scoped) serializability constraints are met, it may be run in parallel, benefiting from multi-core architecture. Veracity is provided as an interpreter that is implemented in Multicore OCaml. The artifact contains a version of the interpreter, provided with Servois2 to drive the commutativity analysis. The benchmark suite used in the paper is provided, as well as the programs/scripts used to ge

APA, Harvard, Vancouver, ISO, and other styles

17

Kosky, Anthony. "Declarative Languages for Advanced Information Technologies." Journal of Information Technology 3, no. 2 (1988): 110–18. http://dx.doi.org/10.1177/026839628800300208.

Full text

Abstract:

In recent times there has been a great increase in interest in declarative programming languages, which are based on sound mathematical formalisms, independent of the machinery on which they are implemented. Such languages are easier to understand and debug, and have advantages with regard to program transformation and verification, and parallel implementation over conventional, imperative languages. In this essay I will discuss the various paradigms available for declarative programming, and also the object orientated programming paradigm, and put forward various ideas that I feel are of part

APA, Harvard, Vancouver, ISO, and other styles

18

Kruglov, Leonid, and Yury Brodsky. "MODEL-ORIENTED PROGRAMMING." Proceedings of CBU in Natural Sciences and ICT 2 (October 24, 2021): 63–67. http://dx.doi.org/10.12955/pns.v2.154.

Full text

Abstract:

The problem of complex multi-component system processing arises in many fields of science and engineering. A system can be described in terms of its components, behavior, and interaction. This work proposes a new declarative Turing complete “model-oriented” programming paradigm based on the concept of “model-component” - a complex structure with well-defined characteristics and behavior, and no external methods. The set of model-components is closed under the union operation of model-components into “model-complex”. The proposed approach allows the program to describe the complex system and be

APA, Harvard, Vancouver, ISO, and other styles

19

Golemanova, Emilia, and Tzanko Golemanov. "Genetic Algorithms in a Visual Declarative Programming." WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS 19 (June 21, 2022): 138–52. http://dx.doi.org/10.37394/23209.2022.19.14.

Full text

Abstract:

mperative languages like Java, C++, and Python are mostly used for the implementation of Genetic algorithms (GA). Other programming paradigms are far from being an object of study. The paper explores the advantages of a new non-mainstream programming paradigm, with declarative and nondeterministic features, in the implementation of GA. Control Network Programming (CNP) is a visual declarative style of programming in which the program is a set of recursive graphs, that are graphically visualized and developed. The paper demonstrates how the GA can be implemented in an automatic, i.e. non-proced

APA, Harvard, Vancouver, ISO, and other styles

20

Gebser, Martin, Tomi Janhunen, and Jussi Rintanen. "Declarative encodings of acyclicity properties." Journal of Logic and Computation 30, no. 4 (2015): 923–52. http://dx.doi.org/10.1093/logcom/exv063.

Full text

Abstract:

Abstract Many knowledge representation tasks involve trees or similar structures as abstract datatypes. However, devising compact and efficient declarative representations of such structural properties is non-obvious and can be challenging indeed. In this article, we take a number of acyclicity properties into consideration and investigate various logic-based approaches to encode them. We use answer set programming as the primary representation language but also consider mappings to related formalisms, such as propositional logic, difference logic and linear programming. We study the compactne

APA, Harvard, Vancouver, ISO, and other styles

21

Watson, I., V. Woods, P. Watson, R. Banach, M. Greenberg, and J. Sargeant. "Flagship: a parallel architecture for declarative programming." ACM SIGARCH Computer Architecture News 16, no. 2 (1988): 124–30. http://dx.doi.org/10.1145/633625.52415.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Mens, Tom, Roel Wuyts, Kris De Volder, and Kim Mens. "Declarative Meta Programming to Support Software Development." ACM SIGSOFT Software Engineering Notes 28, no. 2 (2003): 1. http://dx.doi.org/10.1145/638750.638770.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Myers, Brad A., Dario A. Giuse, and Brad Vander Zanden. "Declarative programming in a prototype-instance system." ACM SIGPLAN Notices 27, no. 10 (1992): 184–200. http://dx.doi.org/10.1145/141937.141953.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Sivaramakrishnan, KC, Gowtham Kaki, and Suresh Jagannathan. "Declarative programming over eventually consistent data stores." ACM SIGPLAN Notices 50, no. 6 (2015): 413–24. http://dx.doi.org/10.1145/2813885.2737981.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Rossi, Gianfranco. "Set-based Nondeterministic Declarative Programming in Singleton." Electronic Notes in Theoretical Computer Science 76 (November 2002): 216–32. http://dx.doi.org/10.1016/s1571-0661(04)80795-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Bakay, Á., L. Madarász, A. Hinsenkamp, Z. Papp, and T. P. Dobrowiecki. "Declarative Programming Tools for Fermentor Control System." IFAC Proceedings Volumes 23, no. 8 (1990): 293–97. http://dx.doi.org/10.1016/s1474-6670(17)51839-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

STAVYTSKYI, Pavlo, and Viktoriia VOITKO. "METHOD OF THE DECLARATIVE METAPROGRAMMING BASED ON DOMAIN-SPECIFIC PROGRAMMING LANGUAGES." Herald of Khmelnytskyi National University. Technical sciences 311, no. 4 (2022): 249–55. http://dx.doi.org/10.31891/2307-5732-2022-311-4-249-255.

Full text

Abstract:

A concept of declarative metaprogramming which focuses on program code generation is considered. The method is based on using domain-specific languages that are implemented by means of existing general-purpose programming languages. Since metaprogramming is based on using programs that produce other programs, the declarative approach means that the input and the output program code must be as close as possible in terms of syntax or ideally identical. In order to generate a program code, it is required to write templates that hold the exact structure of a resulting generated code but contain pl

APA, Harvard, Vancouver, ISO, and other styles

28

DAGNINO, FRANCESCO, DAVIDE ANCONA, and ELENA ZUCCA. "Flexible coinductive logic programming." Theory and Practice of Logic Programming 20, no. 6 (2020): 818–33. http://dx.doi.org/10.1017/s147106842000023x.

Full text

Abstract:

AbstractRecursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations, necessary in some cases to get the correct meaning. We provide a detailed formal account of an extension of logic programming supporting flexible coinduction. Syntactically, programs are enriched by coclauses, clauses with a special meaning used to tune the interpretation of predicates. As usual, the declarative semantics can be expressed as a fixed point

APA, Harvard, Vancouver, ISO, and other styles

29

Rizzo, Nicola, and Agostino Dovier. "3coSoKu and its declarative modeling." Journal of Logic and Computation 32, no. 2 (2022): 307–30. http://dx.doi.org/10.1093/logcom/exab086.

Full text

Abstract:

Abstract In this paper, we analyze the physical puzzle IcoSoKu, a game about placing some given triangular tiles on the faces of an icosahedron in order to fill the capacities of its vertices, and we propose its generalization called 3coSoKu, admitting an arbitrary playing field with triangular faces, arbitrary capacities and an arbitrary set of triangular tiles. First, we prove the strong NP-completeness of 3coSoKu, even when the playing field is a convex polyhedron with equilateral triangles as faces. Second, we encode 3coSoKu both in the constraint modeling language MiniZinc and in the logi

APA, Harvard, Vancouver, ISO, and other styles

30

COSTANTINI, STEFANIA. "SEMANTICS OF A METALOGIC PROGRAMMING LANGUAGE." International Journal of Foundations of Computer Science 01, no. 03 (1990): 233–47. http://dx.doi.org/10.1142/s0129054190000175.

Full text

Abstract:

This paper presents the declarative and procedural semantics of Reflective Prolog, a new logic language able to represent metaknowledge and use it in the proof process via an extended resolution procedure including forms of implicit reflection. The declarative semantics of a Reflective Prolog definite program is provided in terms of the Least Reflective Herbrand Model of the program, characterized by means of a suitable mapping. The extended resolution is then shown to be sound and complete with respect to the Least Reflective Herband Model.

APA, Harvard, Vancouver, ISO, and other styles

31

WIKAREK, Jarosław, Paweł SITEK, and Mieczysław JAGODZIŃSKI. "A DECLARATIVE APPROACH TO SHOP ORDERS OPTIMIZATION." Applied Computer Science 15, no. 4 (2019): 5–15. http://dx.doi.org/10.35784/acs-2019-25.

Full text

Abstract:

The paper presents the problem of material requirements planning with optimization of load distribution between work centers and workers’ groups. Moreover, it discusses the computational example for shop orders optimization. The data for this example were taken from the relational database. The method of Constraint Logic Programming (CLP) for shop orders optimization has been suggested. Using Constraint Logic Programming, the constraints may be directly introduced to the problem declaration, which is equivalent to the source code of the program. The ECLiPSe-CLP software system has been present

APA, Harvard, Vancouver, ISO, and other styles

32

Keane, John A. "An overview of the Flagship system." Journal of Functional Programming 4, no. 1 (1994): 19–45. http://dx.doi.org/10.1017/s0956796800000927.

Full text

Abstract:

AbstractThe Flagship Project1 was a research collaboration between the University of Manchester, Imperial College London and International Computers Ltd. The project was unusual in that it aimed to produce a complete computing system based on a declarative programming style. Three areas of a declarative system were addressed: (1) programming languages and programming environments; (2) the machine architecture and computational models; and (3) the software environment. This overview paper discusses each of these areas, the intention being to present the project as a coherent whole.

APA, Harvard, Vancouver, ISO, and other styles

33

Calimeri, Francesco, Giovambattista Ianni, Thomas Krennwallner, and Francesco Ricca. "The Answer Set Programming Competition." AI Magazine 33, no. 4 (2012): 114. http://dx.doi.org/10.1609/aimag.v33i4.2448.

Full text

Abstract:

The Answer Set Programming (ASP) Competition is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The competition consists of two main tracks: the ASP system track and the model and solve track. The traditional system track compares dedicated answer set solvers on ASP benchmarks, while the model and solve track invites any researcher and developer of declarative knowledge representation systems to participate in an open challenge for solving sophisticated AI problems with their tools of choice. This article provides an overview of t

APA, Harvard, Vancouver, ISO, and other styles

34

Norilo, Vesa. "Kronos: A Declarative Metaprogramming Language for Digital Signal Processing." Computer Music Journal 39, no. 4 (2015): 30–48. http://dx.doi.org/10.1162/comj_a_00330.

Full text

Abstract:

Kronos is a signal-processing programming language based on the principles of semifunctional reactive systems. It is aimed at efficient signal processing at the elementary level, and built to scale towards higher-level tasks by utilizing the powerful programming paradigms of “metaprogramming” and reactive multirate systems. The Kronos language features expressive source code as well as a streamlined, efficient runtime. The programming model presented is adaptable for both sample-stream and event processing, offering a cleanly functional programming paradigm for a wide range of musical signal-p

APA, Harvard, Vancouver, ISO, and other styles

35

HANUS, MICHAEL, and SVEN KOSCHNICKE. "An ER-based framework for declarative web programming." Theory and Practice of Logic Programming 14, no. 3 (2012): 269–91. http://dx.doi.org/10.1017/s1471068412000385.

Full text

Abstract:

AbstractWe describe a framework to support the implementation of web-based systems intended to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore, the

APA, Harvard, Vancouver, ISO, and other styles

36

Lifschitz, Vladimir. "Answer Sets and the Language of Answer Set Programming." AI Magazine 37, no. 3 (2016): 7–12. http://dx.doi.org/10.1609/aimag.v37i3.2670.

Full text

Abstract:

Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory article provides the mathematical background for the discussion of answer set programming in other contributions to this special issue.

APA, Harvard, Vancouver, ISO, and other styles

37

Brewka, Gerhard, Thomas Eiter, and Miroslaw Truszczynski. "Answer Set Programming: An Introduction to the Special Issue." AI Magazine 37, no. 3 (2016): 5–6. http://dx.doi.org/10.1609/aimag.v37i3.2669.

Full text

Abstract:

This editorial introduces answer set programming, a vibrant research area in computational knowledge representation and declarative programming. We give a brief overview of the articles that form this special issue on answer set programming and of the main topics they discuss.

APA, Harvard, Vancouver, ISO, and other styles

38

Appeltauer, Malte, Robert Hirschfeld, and Jens Lincke. "Declarative Layer Composition with The JCop Programming Language." Journal of Object Technology 12, no. 2 (2013): 4:1. http://dx.doi.org/10.5381/jot.2013.12.2.a4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Bujosa, Andrés, and Regino Criado. "SYNTACTIC ELEMENTS OF DECLARATIVE PROGRAMMING: SYMBOLIC LINEAR EQUATIONS." Fundamenta Informaticae 25, no. 1 (1996): 39–48. http://dx.doi.org/10.3233/fi-1996-25104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Greenberg, Mark, and Viv Woods. "Flagship—a parallel reduction machine for declarative programming." Computing & Control Engineering Journal 1, no. 2 (1990): 81. http://dx.doi.org/10.1049/cce:19900022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Zuidberg Dos Martires, Pedro, Luc De Raedt, and Angelika Kimmig. "Declarative probabilistic logic programming in discrete-continuous domains." Artificial Intelligence 337 (December 2024): 104227. http://dx.doi.org/10.1016/j.artint.2024.104227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Yan, Song Yuan. "Foundations of declarative testing in arbitrary logic programming." International Journal of Computer Mathematics 34, no. 3-4 (1990): 145–60. http://dx.doi.org/10.1080/00207169008803872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Negreanu, Lorina. "Declarative Programming with Temporal Constraints, in the LanguageCG." Scientific World Journal 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/540854.

Full text

Abstract:

Specifying and interpreting temporal constraints are key elements of knowledge representation and reasoning, with applications in temporal databases, agent programming, and ambient intelligence. We present and formally characterize the languageCG, which tackles this issue. InCG, users are able to develop time-dependent programs, in a flexible and straightforward manner. Such programs can, in turn, be coupled with evolving environments, thus empowering users to control the environment’s evolution.CGrelies on a structure for storing temporal information, together with a dedicated query mechanism

APA, Harvard, Vancouver, ISO, and other styles

44

Yuan Yan, Song. "Foundations of declarative debugging in arbitrary logic programming." International Journal of Man-Machine Studies 32, no. 2 (1990): 215–32. http://dx.doi.org/10.1016/s0020-7373(05)80047-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Finkelstein, Stacy E., Peter Freyd, and James Lipton. "Erratum to: “A new framework for declarative programming”." Theoretical Computer Science 311, no. 1-3 (2004): 527. http://dx.doi.org/10.1016/j.tcs.2003.09.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Amato, Gianluca, James Lipton, and Robert McGrail. "On the algebraic structure of declarative programming languages." Theoretical Computer Science 410, no. 46 (2009): 4626–71. http://dx.doi.org/10.1016/j.tcs.2009.07.038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Savnik, Iztok, Tomaž Mohorič, and Vanja Josifovski. "Extending database programming language with declarative querying facilities." Microprocessing and Microprogramming 40, no. 10-12 (1994): 905–8. http://dx.doi.org/10.1016/0165-6074(94)90066-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

LOPES, NUNO P., JUAN A. NAVARRO, ANDREY RYBALCHENKO, and ATUL SINGH. "Applying Prolog to develop distributed systems." Theory and Practice of Logic Programming 10, no. 4-6 (2010): 691–707. http://dx.doi.org/10.1017/s1471068410000360.

Full text

Abstract:

AbstractDevelopment of distributed systems is a difficult task. Declarative programming techniques hold a promising potential for effectively supporting programmer in this challenge. While Datalog-based languages have been actively explored for programming distributed systems, Prolog received relatively little attention in this application area so far. In this paper we present a Prolog-based programming system, called DAHL, for the declarative development of distributed systems. DAHL extends Prolog with an event-driven control mechanism and built-in networking procedures. Our experimental eval

APA, Harvard, Vancouver, ISO, and other styles

49

CALIMERI, FRANCESCO, GIOVAMBATTISTA IANNI, and FRANCESCO RICCA. "The third open answer set programming competition." Theory and Practice of Logic Programming 14, no. 1 (2012): 117–35. http://dx.doi.org/10.1017/s1471068412000105.

Full text

Abstract:

AbstractAnswer Set Programming (ASP) is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL and many others. Since its first informal editions, ASP systems have been compared in the now well-established ASP Competition. The Third (Open) ASP Competition, as the sequel to the ASP Competitions Series held at the University of Potsdam in Germany (2006–2007) and at the University of Leuven in Belgium in 2009, took place at the University of Calabria (Italy) in the first hal

APA, Harvard, Vancouver, ISO, and other styles

50

Van Hentenryck, Pascal. "Constraint logic programming." Knowledge Engineering Review 6, no. 3 (1991): 151–94. http://dx.doi.org/10.1017/s0269888900005798.

Full text

Abstract:

AbstractConstraint logic programming (CLP) is a generalization of logic programming (LP) where unification, the basic operation of LP languages, is replaced by constraint handling in a constraint system. The resulting languages combine the advantages of LP (declarative semantics, nondeterminism, relational form) with the efficiency of constraint-solving algorithms. For some classes of combinatorial search problems, they shorten the development time significantly while preserving most of the efficiency of imperative languages. This paper surveys this new class of programming languages from thei

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!