Suchergebnisse - Logic programming] Terms

Non-termination in Term Rewriting and Logic Programming von Payet, Etienne

“… In this paper, we define two particular forms of non-termination, namely loops and binary chains , in an abstract framework that encompasses term rewriting and logic programming …”
Volltext

Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers von BENDKOWSKI, MACIEJ, GRYGIEL, KATARZYNA, TARAU, PAUL

“… A prominent example is the successful use of randomness, in particular, random typable λ-terms, in testing functional programming compilers such as the Glasgow Haskell Compiler …”
Volltext

Random generation of closed simply typed[...]-terms: A synergy between logic programming and Boltzmann samplers von BENDKOWSKI, MACIEJ, GRYGIEL, KATARZYNA, TARAU, PAUL

“… A prominent example is the successful use of randomness, in particular, random typable[...]-terms, in testing functional programming compilers such as the Glasgow Haskell Compiler …”
Volltext

Glossary of computational terms as a stimulus to programming logic: a case study with deaf students von Granada, Rafael Pinto, Barwaldt, Regina, Espindola, Danbia Bueno

“… In addition, programming logic and geometry learning in deaf students will be stimulated. The work will be carried out in a bilingual high school, in the mathematics discipline …”
Volltext

Efficient relational calculation for software analysis von Beyer, D., Noack, A., Lewerentz, C.

“… Calculating with graphs and relations has many applications in the analysis of software systems, for example, the detection of design patterns or patterns of …”
Volltext

Strong categorical datatypes II: A term logic for categorical programming von Cockett, J.Robin B., Spencer, Dwight

“… This paper lifts earlier category-theoretic results on datatypes to the level of an abstract language suitable for categorical programming language implementation …”
Volltext

Non-Termination in Term Rewriting and Logic Programming von Payet, Etienne

“… In this paper, we define two particular forms of non-termination, namely loops and binary chains, in an abstract framework that encompasses term rewriting and logic programming …”
Volltext

Binary Non-Termination in Term Rewriting and Logic Programming von Payet, Étienne

“… and logic programming …”
Volltext

ONTOarg: A decision support framework for ontology integration based on argumentation von Gómez, Sergio Alejandro, Chesñevar, Carlos Iván, Simari, Guillermo Ricardo

“… ) ontologies, translating them into the language of logic programming (LP). Even though DLP offers several advantages in terms of efficiency and reuse of existing …”
Volltext

Justifying answer sets using argumentation von SCHULZ, CLAUDIA, TONI, FRANCESCA

“… using arguments and attacks between them, whereas ABA-Based Answer Set Justifications express the same justification structure in logic programming terms, that is using …”
Volltext

Logic program proportions: Logic program proportions von Antić, Christian

“… into S ” as a mechanism for deriving similar programs by analogy-making. The idea is to instantiate a fragment of a recently introduced abstract algebraic framework of analogical proportions in the domain of logic programming …”
Volltext

Proof checking and logic programming von Miller, Dale

“… : instead, we only need to trust a (smaller and simpler) proof checker. Many approaches to building proof checkers require embedding within them a full programming language …”
Volltext

Abstract Argumentation and Answer Set Programming: Two Faces of Nelson’s Logic von FANDINNO, JORGE, FARIÑAS DEL CERRO, LUIS

“… In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms …”
Volltext

Stratified extended multi-adjoint logic programming von Cornejo, M. Eugenia, Lobo, David, Medina, Jesús

“… Extended multi-adjoint logic programming is a non-monotonic logic programming framework whose semantics is defined in terms of stable models …”
Volltext

Random generation of closed simply-typed \(\lambda\)-terms: a synergy between logic programming and Boltzmann samplers von Bendkowski, Maciej, Grygiel, Katarzyna, Tarau, Paul

“… A prominent example is the successful use of randomness, in particular random typeable \(\lambda\)-terms, in testing functional programming compilers such as the Glasgow Haskell Compiler …”
Volltext

Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis von FARKA, FRANTIŠEK, KOMENDANTSKYA, EKATERINA, HAMMOND, KEVIN

“… We propose a calculus that translates type inference and term synthesis problems in a dependently typed language to a logic program and a goal in the proof-relevant first-order Horn clause logic …”
Volltext

Automated legal reasoning with discretion to act using s(LAW) von Arias, Joaquín, Moreno-Rebato, Mar, Rodriguez-García, Jose A., Ossowski, Sascha

“… Logic Programming, specially Answer Set Programming, has a rich semantics and has been used to very concisely express complex knowledge …”
Volltext

A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations von Tarau, Paul

“… With sound unification, Definite Clause Grammars and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playground …”
Volltext

Fuzzy linguistic logic programming and its applications von LE, VAN HUNG, LIU, FEI, TRAN, DINH KHANG

“… The paper introduces fuzzy linguistic logic programming, which is a combination of fuzzy logic programming, introduced by P. Vojtáš …”
Volltext

Using possibilistic logic for modeling qualitative decision: Answer Set Programming algorithms von Confalonieri, Roberto, Prade, Henri

“… This approach has been transposed into possibilistic logic in which the available knowledge is described by formulas which are more or less certainly true and the goals are described in a separate prioritized base …”
Volltext