Filters








79,000 Hits in 6.8 sec

Towards Applicative Relational Programming [article]

H. Ibrahim, M.H. van Emden
2006 arXiv   pre-print
Functional programming comes in two flavours: one where "functions are first-class citizens" (we call this applicative) and one which is based on equations (we call this declarative).  ...  We show how relations can be first-class citizens, and devise mechanisms for modularity, for local scoping of predicates, and for exporting/importing relations between programs.  ...  Relations can be first-class citizens. One of the most powerful paradigms in computing is "functions as first-class citizens" [8] .  ... 
arXiv:cs/0602099v1 fatcat:r62wdg3qbnaf3jdgmya6i2adyu

Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects [chapter]

Paul Tarau
2000 Lecture Notes in Computer Science  
We design a Fluent class hierarchy which includes first-class stateful objects representing the meta-level Horn Clause Interpreters, file, URL, socket Readers and Writers, as well as data structures like  ...  On top of a simple kernel (Horn Clause Interpreters with LD-resolution) we introduce Fluents, high level stateful objects which empower and simplify the architecture of logic programming languages through  ...  As it is the case with pure functional programming languages, this calculus allows reasoning with referentially transparent, stateless entities.  ... 
doi:10.1007/3-540-44957-4_82 fatcat:7g5fh7d3crczznbtpsk3edjxny

Axiomatization of Aggregates in Answer Set Programming

Jorge Fandinno, Zachary Hansen, Yuliya Lierler
2022 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We prove that for programs without positive recursion through aggregates our semantics coincides with the semantics of the answer set solver Clingo.  ...  The paper presents a characterization of logic programs with aggregates based on many-sorted generalization of operator SM that refers neither to grounding nor to fixpoints.  ...  Cabalar et al. (2018) introduce intensional sets as first-class citizens into Quantified Equilibrium Logic (Pearce and Valverde 2005) with partial functions (Cabalar 2011 ) and provide a formalisation  ... 
doi:10.1609/aaai.v36i5.20504 fatcat:sxtjpb7qvnelnbff4fjlvn3p4m

Search based algorithms for test sequence generation in functional testing

Javier Ferrer, Peter M. Kruse, Francisco Chicano, Enrique Alba
2015 Information and Software Technology  
Results: The experimental analysis compares the search-based technique with a greedy algorithm on a set of 12 hierarchical concurrent models of programs extracted from the literature.  ...  Objective: In this paper we extend one specific combinatorial test approach, the Classification Tree Method (CTM), with transition information to generate test sequences.  ...  It is also partially founded by project 8.06/5.47.4142 in collaboration with the VSB-Tech. Univ. of Ostrava, Universidad de Málaga, Andalucía Tech. and EU grant ICT-257574 (FITTEST project).  ... 
doi:10.1016/j.infsof.2014.07.014 fatcat:t7vdz3vo6jc33idrhiydurzxry

Higher Order Support in Logic Specification Languages for Data Mining Applications

Matthias van der Hallen
2015 International Conference on Logic Programming  
Extended support for data representation is lacking however, and we want to introduce structured recursive types and generic types, together with a first class citizen approach to predicates.  ...  Current logic specification languages, such as FO(•) provide an intuitive way for defining the knowledge within a problem domain.  ...  Furthermore, some additional abstractions are possible in logic programming, such as the treatment of relations as first class citizens.  ... 
dblp:conf/iclp/Hallen15 fatcat:at73p4zcgbguzhkijqsslghtau

Logic programming revisited: logic programs as inductive definitions

Marc Denecker, Maurice Bruynooghe, Victor Marek
2001 ACM Transactions on Computational Logic  
Logic programming has been introduced as programming in the Horn clause subset of first order logic. This view breaks down for the negation as failure inference rule.  ...  To overcome the problem, one line of research has been to view a logic program as a set of iff-definitions.  ...  Apt for his encouragement as well as a number of valuable suggestions. The anonymous referees suggested a number of improvements.  ... 
doi:10.1145/383779.383789 fatcat:ndazuobvzvfzjf53wm5fnswj2y

Multiwavelength classification of X-ray selected galaxy cluster candidates using convolutional neural networks [article]

Matej Kosiba, Maggie Lieu, Bruno Altieri, Nicolas Clerc, Lorenzo Faccioli, Sarah Kendrew, Ivan Valtchanov, Tatyana Sadibekova, Marguerite Pierre, Filip Hroch, Norbert Werner, Lukáš Burget (+6 others)
2020 arXiv   pre-print
Galaxy clusters appear as extended sources in XMM-Newton images, but not all extended sources are clusters.  ...  Our data set originates from the X-CLASS survey sample of galaxy cluster candidates, selected by a specially developed pipeline, the XAmin, tailored for extended source detection and characterisation.  ...  We are also very thankful to all of our citizen volunteers who participated in The Hunt for Galaxy Clusters.  ... 
arXiv:2006.05998v1 fatcat:uevvtakqqrhxlhxqpu6s4zoi74

Prolegomena to logic programming for non-monotonic reasoning [chapter]

Jürgen Dix, Luís Moniz Pereira, Teodor Przymusinski
1997 Lecture Notes in Computer Science  
The next couple of sections provide motivating examples and an overview of the main semantics paradigms for normal programs (stable models and well{founded) and for extended logic programs (answer{sets  ...  , e{answer{ sets, Nelson's strong negation, and well{founded semantics with pseudo and with explicit negation).  ...  A 2{valued interpretation I of an extended logic program P is an answer{set model of P i ?  ... 
doi:10.1007/bfb0023799 fatcat:cv52p4si5reb7nvbrgiom52rga

First Order Logic with Inductive Definitions for Model-Based Problem Solving

Maurice Bruynooghe, Marc Denecker, Miroslaw Truszczynski
2016 The AI Magazine  
In answer-set programming (ASP), programs can be viewed as specifications of finite Herbrand structures.  ...  Other logics can be (and, in fact, were) used towards the same end and can be taken as the basis of declarative programming systems of similar functionality as ASP.  ...  The information components (vocabularies, structures and theories) are first-class citizens in the Lua code and can be passed as parameters to various functions.  ... 
doi:10.1609/aimag.v37i3.2679 fatcat:xqocd5b7k5dpjg3tk25boau6re

On the Semantics of Recursive Bipolar AFs and Partial Stable Models

Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Irina Trubitsyna
2020 International Conference of the Italian Association for Artificial Intelligence  
This result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports.  ...  Extensions of Dung's abstract Argumentation Framework (AF) include the general class of Recursive Bipolar AFs (Rec-BAFs), i.e., AFs with recursive attacks and supports.  ...  Efficient mappings from AF to Answer Set Programming (i.e. LP with Stable Model semantics [26] ) have been investigated as well [35, 24] .  ... 
dblp:conf/aiia/AlfanoGPT20 fatcat:cj7goibkhrep5pjfqzazzubmwm

Adding partial functions to Constraint Logic Programming with sets

MAXIMILIANO CRISTIÁ, GIANFRANCO ROSSI, CLAUDIA FRYDMAN
2015 Theory and Practice of Logic Programming  
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  ...  In particular, the paper shows how the {log} constraint solver is naturally extended in order to accommodate for the new primitive constraints dealing with partial functions.  ...  Conclusions In this paper we have shown how to integrate partial functions as first-class citizens into the CLP language with sets {log}.  ... 
doi:10.1017/s1471068415000290 fatcat:5tb7tm3mgbc65cmsrkbrch2e4q

The mystery of the tower revealed

Mitchell Wand, Daniel P. Friedman
1986 Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86  
Every 3-LISP program is interpreted by a metacircular interpreter, also written in 3-LISP.  ...  Smith proposed a programming language, called 3-LISP, which embodied such self-knowledge in the domain of metacircular interpreters.  ...  In particular, the self-defining set! and the trick for avoiding the use of quote are his.  ... 
doi:10.1145/319838.319871 fatcat:sk6t6dq44rhcni6cfhc4unm7lq

A Relational Algebra as a Query Language for Temporal DATALOG [chapter]

Mehmet A. Orgun, William W. Wadge
1992 Database and Expert Systems Applications  
The minimum model of a given Temporal Datalog program is regarded as the temporal database the program models intensionally.  ...  This paper introduces a temporal relational algebra as a query language for temporal deductive databases, i.e., Temporal Datalog programs.  ...  Temporal relations are not first-class citizens in Temporal Datalog.  ... 
doi:10.1007/978-3-7091-7557-6_48 fatcat:hnfzpzl4lzgltfds4g7jr25tr4

The mystery of the tower revealed: A nonreflective description of the reflective tower

Mitchell Wand, Daniel P. Friedman
1988 LISP and Symbolic Computation  
Every 3-LISP program is interpreted by a metacircular interpreter, also written in 3-LISP.  ...  Smith proposed a programming language, called 3-LISP, which embodied such self-knowledge in the domain of metacircular interpreters.  ...  In particular, the self-defining set! and the trick for avoiding the use of quote are his.  ... 
doi:10.1007/bf01806174 fatcat:prt2lxy5tvbdvnd4los3piedza

Introduction to the 30th International Conference on Logic Programming Special Issue

MICHAEL LEUSCHEL, TOM SCHRIJVERS
2014 Theory and Practice of Logic Programming  
Related Paradigms: Abductive Logic Programming, Inductive Logic Programming, Constraint Logic Programming, Answer-Set Programming; Applications: Databases, Data Integration and Federation, Software Engineering  ...  as a special issue of Theory and Practice of Logic Programming (TPLP) - the30th International Conference on Logic Programming Special Issue.  ...  Bound Founded Answer Set Programming (BFASP) is an extension of Answer Set Programming (ASP) that extends stable model semantics to numeric variables.  ... 
doi:10.1017/s1471068414000581 fatcat:6fczd6mhxjcutozkk6t23lvn5e
« Previous Showing results 1 — 15 out of 79,000 results