Log in

Relevant bibliographies by topics / Logic programming / Journal articles

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

Journal articles on the topic 'Logic 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 'Logic 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

Cohen, Jacques. "Logic programming and constraint logic programming." ACM Computing Surveys 28, no. 1 (1996): 257–59. http://dx.doi.org/10.1145/234313.234416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

KOWALSKI, ROBERT, and FARIBA SADRI. "Programming in logic without logic programming." Theory and Practice of Logic Programming 16, no. 3 (2016): 269–95. http://dx.doi.org/10.1017/s1471068416000041.

Full text

Abstract:

AbstractIn previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states. In this model-theoretic semantics, reactive rules are the driving force, and logic programs play only a supporting role. In the canonical model, states, actions, and other events are represented with timestamps. But in the operational semantics (OS), for the sake

APA, Harvard, Vancouver, ISO, and other styles

3

Oliveira, Kleidson Êglicio Carvalho da Silva. "Paraconsistent Logic Programming in Three and Four-Valued Logics." Bulletin of Symbolic Logic 28, no. 2 (2022): 260. http://dx.doi.org/10.1017/bsl.2021.34.

Full text

Abstract:

AbstractFrom the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well stu

APA, Harvard, Vancouver, ISO, and other styles

4

Robinson, J. A. "Logic and logic programming." Communications of the ACM 35, no. 3 (1992): 40–65. http://dx.doi.org/10.1145/131295.131296.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Voronkov, A. A. "Logic programming and ?-programming." Cybernetics 25, no. 1 (1989): 83–91. http://dx.doi.org/10.1007/bf01074888.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

K, Kwon. "Exception Handling in Logic Programming." Advances in Robotic Technology 1, no. 1 (2023): 1–3. http://dx.doi.org/10.23880/art-16000104.

Full text

Abstract:

One problem on logic programming is to express exception handling. We argue that this problem can be solved by adopting linear logic and prioritized-choice disjunctive goal formulas (PCD) of the form G G 0 *1 ⊕ where G0, G1 are goals. These goals have the following intended semantics: sequentially choose the first true goal GI and execute GI where i (= 0 or 1), discarding the rest if any.

APA, Harvard, Vancouver, ISO, and other styles

7

Genesereth, Michael R., and Matthew L. Ginsberg. "Logic programming." Communications of the ACM 28, no. 9 (1985): 933–41. http://dx.doi.org/10.1145/4284.4287.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Brady, Michael. "Logic Programming." Irish Journal of Psychology 10, no. 2 (1989): 304–16. http://dx.doi.org/10.1080/03033910.1989.10557749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ashbacher, Charles. "From logic to logic programming." Journal of Automated Reasoning 16, no. 3 (1996): 427. http://dx.doi.org/10.1007/bf00252183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

ANTONIOU, GRIGORIS. "LOGIC PROGRAMMING AND DEFAULT LOGIC." International Journal on Artificial Intelligence Tools 03, no. 03 (1994): 367–73. http://dx.doi.org/10.1142/s0218213094000194.

Full text

Abstract:

We present several ideas of increasing complexity how to translate default theories to normal logic programs that make direct use of the deductive capacity of logic programming. We show the limitations of simple, ad hoc approaches, and arrive at a more general construction; its main property is that the answer substitutions computed by the logic program via its standard operational semantics correspond exactly to the extensions of the default theory.

APA, Harvard, Vancouver, ISO, and other styles

11

Shepherdson, J. C. "From Logic to Logic Programming." Computer Journal 38, no. 1 (1995): 78. http://dx.doi.org/10.1093/comjnl/38.1.78.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Van Benthem, Johan. "Logic as Programming." Fundamenta Informaticae 17, no. 4 (1992): 285–317. http://dx.doi.org/10.3233/fi-1992-17402.

Full text

Abstract:

Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles. Next, we provide axiomatizations for Prolog-type inference engines using calculi of sequents employing modified versions of standard structural rules such as monotonicity or permutation. Finally, we discuss the implications of all this for a broader enterprise of ‘abstract proof theory’.

APA, Harvard, Vancouver, ISO, and other styles

13

Subrahmanian, V. S. "Nonmonotonic logic programming." IEEE Transactions on Knowledge and Data Engineering 11, no. 1 (1999): 143–52. http://dx.doi.org/10.1109/69.755623.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Clark, K. L. "Parallel Logic Programming." Computer Journal 33, no. 6 (1990): 482–93. http://dx.doi.org/10.1093/comjnl/33.6.482.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Antoy, Sergio, and Michael Hanus. "Functional logic programming." Communications of the ACM 53, no. 4 (2010): 74–85. http://dx.doi.org/10.1145/1721654.1721675.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Cheney, James, and Christian Urban. "Nominal logic programming." ACM Transactions on Programming Languages and Systems 30, no. 5 (2008): 1–47. http://dx.doi.org/10.1145/1387673.1387675.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Brogi, Antonio, and Roberto Gorrieri. "Distributed Logic Programming." Journal of Logic Programming 15, no. 4 (1993): 295–335. http://dx.doi.org/10.1016/s0743-1066(14)80002-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Abadi, Martín, and Zohar Manna. "Temporal logic programming." Journal of Symbolic Computation 8, no. 3 (1989): 277–95. http://dx.doi.org/10.1016/s0747-7171(89)80070-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

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

20

Vojtáš, Peter. "Fuzzy logic programming." Fuzzy Sets and Systems 124, no. 3 (2001): 361–70. http://dx.doi.org/10.1016/s0165-0114(01)00106-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Ebrahim, Rafee. "Fuzzy logic programming." Fuzzy Sets and Systems 117, no. 2 (2001): 215–30. http://dx.doi.org/10.1016/s0165-0114(98)00300-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Muggleton, Stephen. "Inductive logic programming." New Generation Computing 8, no. 4 (1991): 295–318. http://dx.doi.org/10.1007/bf03037089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bonatti, Piero A. "Autoepistemic logic programming." Journal of Automated Reasoning 13, no. 1 (1994): 35–67. http://dx.doi.org/10.1007/bf00881911.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

KAKAS, A. C., R. A. KOWALSKI, and F. TONI. "Abductive Logic Programming." Journal of Logic and Computation 2, no. 6 (1992): 719–70. http://dx.doi.org/10.1093/logcom/2.6.719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Laenens, Els, Domenico Sacca, and Dirk Vermeir. "Extending logic programming." ACM SIGMOD Record 19, no. 2 (1990): 184–93. http://dx.doi.org/10.1145/93605.98728.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Pau, L. F., and H. Olason. "Visual logic programming." Journal of Visual Languages & Computing 2, no. 1 (1991): 3–15. http://dx.doi.org/10.1016/s1045-926x(05)80049-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Nguyen, Linh Anh. "Multimodal logic programming." Theoretical Computer Science 360, no. 1-3 (2006): 247–88. http://dx.doi.org/10.1016/j.tcs.2006.03.026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Muggleton, Stephen. "Inductive logic programming." ACM SIGART Bulletin 5, no. 1 (1994): 5–11. http://dx.doi.org/10.1145/181668.181671.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Brogi, Antonio, Paolo Mancarella, Dino Pedreschi, and Franco Turini. "Modular logic programming." ACM Transactions on Programming Languages and Systems 16, no. 4 (1994): 1361–98. http://dx.doi.org/10.1145/183432.183528.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Bruynooghe, Maurice, and Victor Marek. "Logic programming revisited." ACM Transactions on Computational Logic 2, no. 4 (2001): 623–54. http://dx.doi.org/10.1145/383779.383789.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Vardi, MosheY. "Database logic programming." Journal of Logic Programming 10, no. 3-4 (1991): 179–80. http://dx.doi.org/10.1016/0743-1066(91)90035-n.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Ng, Raymond, and V. S. Subrahmanian. "Probabilistic logic programming." Information and Computation 101, no. 2 (1992): 150–201. http://dx.doi.org/10.1016/0890-5401(92)90061-j.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Tyugu, Enn. "Inductive Logic Programming." Knowledge-Based Systems 7, no. 2 (1994): 149–50. http://dx.doi.org/10.1016/0950-7051(94)90030-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Baldwin, J. F. "Support logic programming." International Journal of Intelligent Systems 1, no. 2 (1986): 73–104. http://dx.doi.org/10.1002/int.4550010202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Bollen, A. W. "Relevant logic programming." Journal of Automated Reasoning 7, no. 4 (1991): 563–85. http://dx.doi.org/10.1007/bf01880329.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Blair, Howard A., and V. S. Subrahmanian. "Paraconsistent logic programming." Theoretical Computer Science 68, no. 2 (1989): 135–54. http://dx.doi.org/10.1016/0304-3975(89)90126-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Díaz, Jaime, José Luis Carballido, and Mauricio Osorio. "Béziau’s SP3A Logic and Logic Programming." Research in Computing Science 148, no. 3 (2019): 309–20. http://dx.doi.org/10.13053/rcs-148-3-26.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

ANTONIOU, GRIGORIS, DAVID BILLINGTON, GUIDO GOVERNATORI, and MICHAEL J. MAHER. "Embedding defeasible logic into logic programming." Theory and Practice of Logic Programming 6, no. 06 (2006): 703–35. http://dx.doi.org/10.1017/s1471068406002778.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Schlipf, John S. "Formalizing a logic for logic programming." Annals of Mathematics and Artificial Intelligence 5, no. 2-4 (1992): 279–302. http://dx.doi.org/10.1007/bf01543479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

OSORIO, MAURICIO, JUAN A. NAVARRO, and JOSÉ ARRAZOLA. "Applications of intuitionistic logic in Answer Set Programming." Theory and Practice of Logic Programming 4, no. 3 (2004): 325–54. http://dx.doi.org/10.1017/s1471068403001881.

Full text

Abstract:

We present some applications of intermediate logics in the field of Answer Set Programming (ASP). A brief, but comprehensive introduction to the answer set semantics, intuitionistic and other intermediate logics is given. Some equivalence notions and their applications are discussed. Some results on intermediate logics are shown, and applied later to prove properties of answer sets. A characterization of answer sets for logic programs with nested expressions is provided in terms of intuitionistic provability, generalizing a recent result given by Pearce. It is known that the answer set semanti

APA, Harvard, Vancouver, ISO, and other styles

41

Balbiani, Philippe. "A Modal Semantics of Negation in Logic Programming." Fundamenta Informaticae 16, no. 3-4 (1992): 231–62. http://dx.doi.org/10.3233/fi-1992-163-403.

Full text

Abstract:

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal comple

APA, Harvard, Vancouver, ISO, and other styles

42

HUET, GÉRARD. "Special issue on ‘Logical frameworks and metalanguages’." Journal of Functional Programming 13, no. 2 (2003): 257–60. http://dx.doi.org/10.1017/s0956796802004549.

Full text

Abstract:

There is both a great unity and a great diversity in presentations of logic. The diversity is staggering indeed – propositional logic, first-order logic, higher-order logic belong to one classification; linear logic, intuitionistic logic, classical logic, modal and temporal logics belong to another one. Logical deduction may be presented as a Hilbert style of combinators, as a natural deduction system, as sequent calculus, as proof nets of one variety or other, etc. Logic, originally a field of philosophy, turned into algebra with Boole, and more generally into meta-mathematics with Frege and

APA, Harvard, Vancouver, ISO, and other styles

43

Sakama, Chiaki, and Katsumi Inoue. "Abductive logic programming and disjunctive logic programming: their relationship and transferability." Journal of Logic Programming 44, no. 1-3 (2000): 75–100. http://dx.doi.org/10.1016/s0743-1066(99)00073-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Williams, H. P. "Logic applied to integer programming and integer programming applied to logic." European Journal of Operational Research 81, no. 3 (1995): 605–16. http://dx.doi.org/10.1016/0377-2217(93)e0359-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

LEUSCHEL, MICHAEL, and TOM SCHRIJVERS. "Introduction to the 30th International Conference on Logic Programming Special Issue." Theory and Practice of Logic Programming 14, no. 4-5 (2014): 401–14. http://dx.doi.org/10.1017/s1471068414000581.

Full text

Abstract:

The 30th edition of the International Conference of Logic Programming took place in Vienna in July 2014 at the Vienna Summer of Logic - the largest scientific conference in the history of logic. Following the initiative in 2010 taken by the Association for Logic Programming and Cambridge University Press, the full papers accepted for the International Conference on Logic Programming again appear as a special issue of Theory and Practice of Logic Programming (TPLP) - the 30th International Conference on Logic Programming Special Issue. Papers describing original, previously unpublished research

APA, Harvard, Vancouver, ISO, and other styles

46

MARCOPOULOS, ELIAS, and YUANLIN ZHANG. "onlineSPARC: A Programming Environment for Answer Set Programming." Theory and Practice of Logic Programming 19, no. 2 (2018): 262–89. http://dx.doi.org/10.1017/s1471068418000509.

Full text

Abstract:

AbstractRecent progress in logic programming (e.g. the development of the answer set programming (ASP) paradigm) has made it possible to teach it to general undergraduate and even middle/high school students. Given the limited exposure of these students to computer science, the complexity of downloading, installing, and using tools for writing logic programs could be a major barrier for logic programming to reach a much wider audience. We developed onlineSPARC, an online ASP environment with a self-contained file system and a simple interface. It allows users to type/edit logic programs and pe

APA, Harvard, Vancouver, ISO, and other styles

47

GALLAGHER, JOHN, and MICHAEL GELFOND. "Introduction to the 27th International Conference on Logic Programming Special Issue." Theory and Practice of Logic Programming 11, no. 4-5 (2011): 429–32. http://dx.doi.org/10.1017/s1471068411000342.

Full text

Abstract:

Following the initiative in 2010 taken by the Association for Logic Programming and Cambridge University Press, the full papers accepted for the International Conference on Logic Programming again appear as a special issue of Theory and Practice of Logic Programming (TPLP)—the 27th International Conference on Logic Programming Special Issue. Papers describing original, previously unpublished research and not simultaneously submitted for publication elsewhere were solicited in all areas of logic programming including but not restricted to: Theory: Semantic Foundations, Formalisms, Non- monotoni

APA, Harvard, Vancouver, ISO, and other styles

48

Vauzeilles, J., and A. Strauss. "Intuitionistic three-valued logic and logic programming." RAIRO - Theoretical Informatics and Applications 25, no. 6 (1991): 557–87. http://dx.doi.org/10.1051/ita/1991250605571.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Genito, Daniele, Giangiacomo Gerla, and Alessandro Vignes. "Meta-logic programming for a synonymy logic." Soft Computing 14, no. 3 (2009): 299–311. http://dx.doi.org/10.1007/s00500-009-0404-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Glasgow, J. I., M. A. Jenkins, E. Blevis, and M. P. Feret. "Logic programming with arrays." IEEE Transactions on Knowledge and Data Engineering 3, no. 3 (1991): 307–19. http://dx.doi.org/10.1109/69.91061.

Full text

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!