Log in

Relevant bibliographies by topics / Intensional programming / Journal articles

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

Journal articles on the topic 'Intensional programming'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 February 2022

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

Select a source type:

Consult the top 30 journal articles for your research on the topic 'Intensional 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

van Otterlo, Martijn. "Intensional dynamic programming. A Rosetta stone for structured dynamic programming." Journal of Algorithms 64, no. 4 (October 2009): 169–91. http://dx.doi.org/10.1016/j.jalgor.2009.04.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Galanaki, Chrysida, Christos Nomikos, and Panos Rondogiannis. "Game semantics for non-monotonic intensional logic programming." Annals of Pure and Applied Logic 168, no. 2 (February 2017): 234–53. http://dx.doi.org/10.1016/j.apal.2016.10.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Orgun, Mehmet A., and William W. Wadge. "Towards a unified theory of intensional logic programming." Journal of Logic Programming 13, no. 4 (August 1992): 413–40. http://dx.doi.org/10.1016/0743-1066(92)90055-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Majkić, Zoran, and Bhanu Prasad. "Intensional FOL for reasoning about probabilities and probabilistic logic programming." International Journal of Intelligent Information and Database Systems 11, no. 1 (2018): 79. http://dx.doi.org/10.1504/ijiids.2018.091627.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Majkić, Zoran, and Bhanu Prasad. "Intensional FOL for reasoning about probabilities and probabilistic logic programming." International Journal of Intelligent Information and Database Systems 11, no. 1 (2018): 79. http://dx.doi.org/10.1504/ijiids.2018.10012745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cimiano, Philipp, Sebastian Rudolph, and Helena Hartfiel. "Computing intensional answers to questions – An inductive logic programming approach." Data & Knowledge Engineering 69, no. 3 (March 2010): 261–78. http://dx.doi.org/10.1016/j.datak.2009.10.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Plaice, John, Blanca Mancilla, and Gabriel Ditu. "From Lucid to TransLucid: Iteration, Dataflow, Intensional and Cartesian Programming." Mathematics in Computer Science 2, no. 1 (November 2008): 37–61. http://dx.doi.org/10.1007/s11786-008-0043-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

HARRISON, AMELIA, and VLADIMIR LIFSCHITZ. "Stable models for infinitary formulas with extensional atoms." Theory and Practice of Logic Programming 16, no. 5-6 (September 2016): 771–86. http://dx.doi.org/10.1017/s1471068416000314.

Full text

Abstract:

AbstractThe definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used to reason about infinitary definitions.

APA, Harvard, Vancouver, ISO, and other styles

9

Balbiani, Philippe. "A Modal Semantics of Negation in Logic Programming." Fundamenta Informaticae 16, no. 3-4 (May 1, 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

10

CABALAR, PEDRO, JORGE FANDINNO, LUIS FARIÑAS DEL CERRO, and DAVID PEARCE. "Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 390–405. http://dx.doi.org/10.1017/s1471068418000169.

Full text

Abstract:

AbstractIn this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (${\rm QEL}^=_{\cal F}$). Then, we proceed to incorporate a new kind of logical term,intensional set(a construct commonly used to denote the set of objects characterised by a given formula), and to extend${\rm QEL}^=_{\cal F}$semantics for

APA, Harvard, Vancouver, ISO, and other styles

11

Fourtounis, Georgios, Nikolaos Papaspyrou, and Panagiotis Theofilopoulos. "Modular polymorphic defunctionalization." Computer Science and Information Systems 11, no. 4 (2014): 1417–34. http://dx.doi.org/10.2298/csis130923030f.

Full text

Abstract:

Defunctionalization is generally considered a whole-program transformation and thus incompatible with separate compilation. In this paper, we formalize a modular variant of defunctionalization which can support separate compilation for a functional programming language with parametric polymorphism. Our technique allows modules in a Haskell-like language to be separately defunctionalized and compiled, then linked together to generate an executable program. We provide a prototype implementation of our modular defunctionalization technique and we discuss the experiences of its application in comp

APA, Harvard, Vancouver, ISO, and other styles

12

TRIVELLATO, DANIEL, NICOLA ZANNONE, and SANDRO ETALLE. "GEM: A distributed goal evaluation algorithm for trust management." Theory and Practice of Logic Programming 14, no. 3 (December 3, 2012): 293–337. http://dx.doi.org/10.1017/s1471068412000397.

Full text

Abstract:

AbstractTrust management is an approach to access control in distributed systems where access decisions are based on policy statements issued by multiple principals and stored in a distributed manner. In trust management, the policy statements of a principal can refer to other principals' statements; thus, the process of evaluating an access request (i.e., a goal) consists of finding a “chain” of policy statements that allows the access to the requested resource. Most existing goal evaluation algorithms for trust management either rely on a centralized evaluation strategy, which consists of co

APA, Harvard, Vancouver, ISO, and other styles

13

DUNG, PHAN MINH, DO DUC HANH, and PHAN MINH THANG. "Stabilization of cooperative information agents in unpredictable environment: a logic programming approach." Theory and Practice of Logic Programming 6, no. 1-2 (January 2006): 1–22. http://dx.doi.org/10.1017/s1471068405002553.

Full text

Abstract:

An information agent is viewed as a deductive database consisting of three parts: an observation database containing the facts the agent has observed or sensed from its surrounding environment;an input database containing the information the agent has obtained from other agents;an intensional database which is a set of rules for computing derived information from the information stored in the observation and input databases.Stabilization of a system of information agents represents a capability of the agents to eventually get correct information about their surrounding despite unpredictable en

APA, Harvard, Vancouver, ISO, and other styles

14

NADATHUR, GOPALAN. "A treatment of higher-order features in logic programming." Theory and Practice of Logic Programming 5, no. 3 (May 2005): 305–54. http://dx.doi.org/10.1017/s1471068404002297.

Full text

Abstract:

The logic programming paradigm provides the basis for a new intensional view of higher-order notions. This view is realized primarily by employing the terms of a typed lambda calculus as representational devices and by using a richer form of unification for probing their structures. These additions have important meta-programming applications but they also pose non-trivial implementation problems. One issue concerns the machine representation of lambda terms suitable to their intended use: an adequate encoding must facilitate comparison operations over terms in addition to supporting the usual

APA, Harvard, Vancouver, ISO, and other styles

15

Japaridze, Giorgi. "Arithmetics based on computability logic." Logical Investigations 25, no. 2 (December 23, 2019): 61–74. http://dx.doi.org/10.21146/2074-1472-2019-25-2-61-74.

Full text

Abstract:

This paper is a brief survey of number theories based on em computability logic (CoL) a game-semantically conceived logic of computational tasks of resources. Such theories, termed em clarithmetics, are conservative extensions of first-order Peano arithmetic.   The first section of the paper lays out the conceptual basis of CoL and describes the relevant fragment of its formal language, with so called parallel connectives, choice connectives and quantifiers, and blind quantifiers. Both syntactically and semantically, this is a conservative generalization of the language of classica

APA, Harvard, Vancouver, ISO, and other styles

16

MØGELBERG, RASMUS E., and MARCO PAVIOTTI. "Denotational semantics of recursive types in synthetic guarded domain theory." Mathematical Structures in Computer Science 29, no. 3 (May 15, 2018): 465–510. http://dx.doi.org/10.1017/s0960129518000087.

Full text

Abstract:

Just like any other branch of mathematics, denotational semantics of programming languages should be formalised in type theory, but adapting traditional domain theoretic semantics, as originally formulated in classical set theory to type theory has proven challenging. This paper is part of a project on formulating denotational semantics in type theories with guarded recursion. This should have the benefit of not only giving simpler semantics and proofs of properties such as adequacy, but also hopefully in the future to scale to languages with advanced features, such as general references, outs

APA, Harvard, Vancouver, ISO, and other styles

17

CHAPMAN, JAMES, TARMO UUSTALU, and NICCOLÒ VELTRI. "Quotienting the delay monad by weak bisimilarity." Mathematical Structures in Computer Science 29, no. 1 (October 17, 2017): 67–92. http://dx.doi.org/10.1017/s0960129517000184.

Full text

Abstract:

The delay datatype was introduced by Capretta (Logical Methods in Computer Science, 1(2), article 1, 2005) as a means to deal with partial functions (as in computability theory) in Martin-Löf type theory. The delay datatype is a monad. It is often desirable to consider two delayed computations equal, if they terminate with equal values, whenever one of them terminates. The equivalence relation underlying this identification is called weak bisimilarity. In type theory, one commonly replaces quotients with setoids. In this approach, the delay datatype quotiented by weak bisimilarity is still a m

APA, Harvard, Vancouver, ISO, and other styles

18

Duží, Marie. "Negation and presupposition, truth and falsity." Studies in Logic, Grammar and Rhetoric 54, no. 1 (June 1, 2018): 15–46. http://dx.doi.org/10.2478/slgr-2018-0014.

Full text

Abstract:

Abstract There are many kinds of negation and denial. Perhaps the most common is the Boolean negation not that applies to propositions-in-extension, i.e. truth-values. The others are, inter alia, the property of propositions of not being true which applies to propositions; the complement function which applies to sets; privation which applies to properties; negation as failure applied in logic programming; negation as argumentation ad absurdum, and many others. The goal of this paper is neither to provide a complete list, nor to analyse all of them. Rather, I am going to deal with negation of

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Shuang Li, Cheng Jun Xie, Su Yan, Shu Ying Zhang, and Yue Gao. "Philosophical Perspective of Object-Oriented Programming." Applied Mechanics and Materials 543-547 (March 2014): 3141–45. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3141.

Full text

Abstract:

Object-oriented method has been carried on the deep philosophical thinking, starting from thinking mode in combination with the real things, so the mapping relationship between real things and Object-oriented Programming is expounded, the essential feature of Object-oriented Programming is revealed. The objectivity, adaptation, complexity and emergent property of Object-oriented Programming whose intension and extension are enlarged are investigated, at this time, its own development direction is specified. The paper explores Object-oriented Programming from the epistemological and methodologi

APA, Harvard, Vancouver, ISO, and other styles

20

Wang, Huai Yu, and Shu Gui Liu. "A Collision Detection Algorithm Using AABB and Octree Space Division." Advanced Materials Research 989-994 (July 2014): 2389–92. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.2389.

Full text

Abstract:

NC lathe controls the action of the lathe through program control system, while programming mistakes may lead to collisions between NC lathe cutters and workpieces or fixtures. A collision detection system judge whether there are collisions ahead of time by means of reading the information of shape and pose of objects in processing environment, building a space model using CSG and acquring the movement intension of objects. Dividing the modeling space into space nodes using octree, building AABBs of objects to be tested and locating them at certain space nodes, only objects at the same node or

APA, Harvard, Vancouver, ISO, and other styles

21

Lee, Jong-Hyun, Javad Rahimipour Anaraki, Chang Wook Ahn, and Jinung An. "Efficient classification system based on Fuzzy–Rough Feature Selection and Multitree Genetic Programming for intension pattern recognition using brain signal." Expert Systems with Applications 42, no. 3 (February 2015): 1644–51. http://dx.doi.org/10.1016/j.eswa.2014.09.048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Bulíček, Josef. "Timetable synchronisation: Urban public transport in busy hubs of long-distance transport." MATEC Web of Conferences 239 (2018): 02001. http://dx.doi.org/10.1051/matecconf/201823902001.

Full text

Abstract:

The article is focused on timetable synchronization problem. Interconnection of urban public transport and long-distance transport in busy hubs is researched. Intension is to find adequate time positions of urban public transport arrivals and departures with an effort to minimize passengers’ time loss related to this interchange. Timetable of long distance transport is considered as constant (given). Timetable of urban public transport is result of optimization (and presupposed to be periodic). Nonlinear integer mathematical programming model is formulated. Model is implemented in Microsoft Ex

APA, Harvard, Vancouver, ISO, and other styles

23

B.K, Anish, Niranjan Devkota, Nabaraj Gautam, and Niraj Paija. "Industry Willingness to Pay for Adequate Electricity Supply: A Discourse on Sustainable Industrial Development." Quest Journal of Management and Social Sciences 1, no. 2 (December 31, 2019): 251–59. http://dx.doi.org/10.3126/qjmss.v1i2.27443.

Full text

Abstract:

Background: Hopefully, if rest of things work as expected, the adequate supply of electricity, as one of the major industrial energy inputs, plays vital role in determining the industrial production, at large. In this paper, the present researchers assumed that the present state of scarcity of electricity may reveal their higher level of willingness to pay for higher energy efficient ratio as a pay-off of their improved industrial productivity. It is a proven fact that as one of the dominant indicators of national economic development and prosperity, effective electricity management procedures

APA, Harvard, Vancouver, ISO, and other styles

24

Zhong, Hui, Weili Bao, Yunfeng Liu та Karina Yazdanbakhsh. "Inflammation Response Cytokines IFN-γ and IL-10 Regulate Monocyte Subset Differentiation". Blood 134, Supplement_1 (13 листопада 2019): 3586. http://dx.doi.org/10.1182/blood-2019-129515.

Full text

Abstract:

Circulating monocytes comprise of a heterogeneous and functionally-diverse cell population which based on surface markers can be divided into three subsets: classical (CMo), intermediate (IMo), and non-classical monocytes/patrolling monocytes (PMo). The frequency/number, gene expression profile and activity of IMo and PMo significantly change in a variety of inflammatory diseases with the changes associated with disease risk and severity as well as response to treatment. While it is believed that CMo differentiate into IMo and that IMo further differentiate into PMo, there is paucity of data o

APA, Harvard, Vancouver, ISO, and other styles

25

Lappin, Shalom. "Intensions as Computable Functions." Linguistic Issues in Language Technology 9 (January 1, 2014). http://dx.doi.org/10.33011/lilt.v9i.1323.

Full text

Abstract:

Classical intensional semantic frameworks, like Montague’s Intensional Logic (IL), identify intensional identity with logical equivalence. This criterion of co-intensionality is excessively coarse-grained, and it gives rise to several well-known difficulties. Theories of fine-grained intensionality have been been proposed to avoid this problem. Several of these provide a formal solution to the problem, but they do not ground this solution in a substantive account of intensional difference. Applying the distinction between operational and denotational meaning, developed for the semantics of pro

APA, Harvard, Vancouver, ISO, and other styles

26

Yamada, Norihiro, and Samson Abramsky. "Dynamic game semantics." Mathematical Structures in Computer Science, December 18, 2020, 1–60. http://dx.doi.org/10.1017/s0960129520000250.

Full text

Abstract:

Abstract The present work achieves a mathematical, in particular syntax-independent, formulation of dynamics and intensionality of computation in terms of games and strategies. Specifically, we give game semantics of a higher-order programming language that distinguishes programmes with the same value yet different algorithms (or intensionality) and the hiding operation on strategies that precisely corresponds to the (small-step) operational semantics (or dynamics) of the language. Categorically, our games and strategies give rise to a cartesian closed bicategory, and our game semantics forms

APA, Harvard, Vancouver, ISO, and other styles

27

HILLERSTRÖM, DANIEL, SAM LINDLEY, and ROBERT ATKEY. "Effect handlers via generalised continuations." Journal of Functional Programming 30 (2020). http://dx.doi.org/10.1017/s0956796820000040.

Full text

Abstract:

Abstract Plotkin and Pretnar’s effect handlers offer a versatile abstraction for modular programming with user-defined effects. This paper focuses on foundations for implementing effect handlers, for the three different kinds of effect handlers that have been proposed in the literature: deep, shallow, and parameterised. Traditional deep handlers are defined by folds over computation trees and are the original construct proposed by Plotkin and Pretnar. Shallow handlers are defined by case splits (rather than folds) over computation trees. Parameterised handlers are deep handlers extended with a

APA, Harvard, Vancouver, ISO, and other styles

28

Meshalkin, V. P., and V. I. Bobkov. "Power and Resourse Efficient Envoronmentally Safe Technology for Processing Dumps of Technogenic Waste From Ore-Dressing and Processing Enterprises." KnE Materials Science, December 31, 2020. http://dx.doi.org/10.18502/kms.v6i1.8098.

Full text

Abstract:

   This research proposes a systematic approach for the analysis of volumes, physicochemical, granulometric, lithologic and thermal characteristics of waste from ore-dressing and processing enterprises stored in the dumps (tailing dumps) of ore-dressing and processing plants to assess the economic potential of its use in the system of complex power and resource efficient environmentally safe processing including palletizing machines, conveyor indurating machines and ore–thermal furnaces. The obtained results allow the authors to formulate the basic engineering, technological,

APA, Harvard, Vancouver, ISO, and other styles

29

"Leaf Disease Detection using Labview Imaq Vision." Regular 9, no. 3 (September 30, 2020): 481–92. http://dx.doi.org/10.35940/ijrte.c4574.099320.

Full text

Abstract:

The intension of our project is to design a system which can identify the good leaves from the diseased ones. Image processing is a powerful tool capable of many applications. Image processing combined with Machine Vision can simulate and execute real time projects. In this project we have used LabVIEW along with IMAQ Vision to acquire real time images and process them. LabVIEW IMAQ Vision is potentially useful for agricultural products since it combines the merits of both LabVIEW and IMAQ Vision, which have graphical programming environment and rich image processing functions. The project aim

APA, Harvard, Vancouver, ISO, and other styles

30

"Software Test Case Generation and it’s curtail using G-Genetic Algorithm." International Journal of Recent Technology and Engineering 8, no. 2 (July 30, 2019): 852–55. http://dx.doi.org/10.35940/ijrte.a3400.078219.

Full text

Abstract:

Project is a collection of similar activities that are going to be executed in certain order. Among the phases of project management testing show business crucial role. The intension of testing is not to prove the correctness; it is the process of verifying and validation. Software Testing is the most challenging job among all the peers of the industry. Exhaustive software Testing is never possible only Optimized software testing is possible. Hence Software Testing can be viewed as optimization problem as it fall under NP complete. Because of the extensive number of experiments that are requir

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!