• Aucun résultat trouvé

Declarative Programming -- Logic Programming

Conformance Checking with Constraint Logic Programming: The Case of Feature Models

Conformance Checking with Constraint Logic Programming: The Case of Feature Models

... proposed declarative-based approaches to check the integrity of deductive ...of declarative programming as a solution to detect inconsistencies in different domains and encourage us to find solutions ...

11

Private types in Higher Order Logic Programming

Private types in Higher Order Logic Programming

... Definition 1 (private type) A type T is private in a module M, if all clauses p A 1 . . . A n ← H in M are such that constructors of T : (1) do not occur in the premise H and (2) if they occur in argument A i to the ...

4

Implementing HOL in an Higher Order Logic Programming Language

Implementing HOL in an Higher Order Logic Programming Language

... pp (X <=> Y) (eq " prop ’ A ’ B) :- pp X A, pp Y B. pp (X = Y) (eq " _ ’ A ’ B) :- pp X A, pp Y B. Following the spirit of Prolog the pp predicate relates pretty printed expressions and their low level ...

11

Extending Answer Set Programming using Generalized Possibilistic Logic

Extending Answer Set Programming using Generalized Possibilistic Logic

... set programming (ASP) is a form of logic programming in which negation-as-failure is de- fined in a purely declarative way, based on the no- tion of a stable ...possibilistic logic ...

7

Conjunto: Constraint Logic Programming with Finite Set Domains

Conjunto: Constraint Logic Programming with Finite Set Domains

... the declarative aspect of Prolog in order to solve combinatorial problems based on sets, relations or graphs (minimum node cover, minimum set cover, set partitioning, set ...Linear Programming (ILP) or ...

22

Extending Answer Set Programming using Generalized Possibilistic Logic

Extending Answer Set Programming using Generalized Possibilistic Logic

... set programming (ASP) is a form of logic programming in which negation-as-failure is de- fined in a purely declarative way, based on the no- tion of a stable ...possibilistic logic ...

6

Implementing Type Theory in Higher Order Constraint Logic Programming

Implementing Type Theory in Higher Order Constraint Logic Programming

... ground terms. Typically a proof term is incrementally built by the elaborator: start- ing from a metavariable that has the type of the conjecture, the proof commands make progress by instantiating it with partial terms. ...

27

On the Properties of Atom Definability and Well-Supportedness in Logic Programming

On the Properties of Atom Definability and Well-Supportedness in Logic Programming

... monotonic logic that defines satisfaction of a rule body before applying the rule to derive a new ...classical logic, both ...Equilibrium Logic or Clark’s ...

15

Colourful linear programming

Colourful linear programming

... linear programming, linear pro- gramming, and linear complementarity ...linear programming generalizes both linear programming and the linear complementarity problem defined by Cottle in ...Linear ...

122

Lazier Imperative Programming

Lazier Imperative Programming

... But twenty years later, very little has been done in this way. . . An interesting approach is iteratees [Kiselyov et al., 2012] that offers lazy evaluation for a consumer-programming style for streams. However ...

38

Logic programming reveals alteration of key transcription factors in multiple myeloma

Logic programming reveals alteration of key transcription factors in multiple myeloma

... Loiseau 4 , Catherine Guérin-Charbonnel 2,5 , Wilfried Gouraud 2,5 , Michel Attal 6 , Thierry Facon 7 , Nikhil C Munshi 8,9 , Philippe Moreau 2,3 , Loïc Campion 2,5 , Florence Magrangeas 2,3 & Carito Guziolowski 1 ...

13

ALGOID, Programming Turtle

ALGOID, Programming Turtle

... Reactive Programming) La programmation fonctionnelle réactive est un idiome dans lequel les états ne sont plus considérés comme figés dans le temps, mais varient en fonction de ...

165

Meta-programming and Multi-stage Programming for GPGPUs

Meta-programming and Multi-stage Programming for GPGPUs

... 2 Related Works Software libraries for GPGPU computing try to simplify the new programming paradigm brought by many-core based systems. The general trend followed in recent years by C++ libraries is to provide a ...

25

Declarative symbolic pure-logic model checking

Declarative symbolic pure-logic model checking

... While Alloy Alpha could model systems where the overall system state is described by graphs and relations, it had no systematic way of modeling multiple, distinct [r] ...

181

Advancing declarative programming

Advancing declarative programming

... including an implementation of the first general-purpose constraint solver capable of automatically solving formulas with higher-order quantification over bounded do- mains, [r] ...

153

Programming Robots With Events

Programming Robots With Events

... 5 Conclusion and Future Work In this paper, we presented how to write robot applications by using INI, a novel programming language that supports event-based paradigm. Programmers may use built-in events, or ...

13

Toward certified quantum programming

Toward certified quantum programming

... References [1] Alexandru Baltag and Sonja Smets. Lqp: the dynamic logic of quantum information. Mathe- matical structures in computer science, 2006. [2] François Bobot, Jean-Christophe Filliâtre, Claude Marché, ...

4

Functional programming using CAML

Functional programming using CAML

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

129

Constraint Programming within CLIPS

Constraint Programming within CLIPS

... Keywords CCP, CSP, Constraint Programming 1. Introduction A wide variety of problems can be described as Constraint Satisfaction Problems (CSPs) : time table, cross- words, graph colouring, job shop scheduling, ...

30

Model-Driven Constraint Programming

Model-Driven Constraint Programming

... Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calculate the solu- tions. This paper ...

12

Show all 1193 documents...

Sujets connexes