• LUPS

  • Referenced in 36 articles [sw02579]
  • LUPS -- a language for updating logic programs. Most of the work conducted ... field of logic programming has focused on representing static knowledge, i.e. knowledge that does ... authors introduced the concept of dynamic logic programming. There, they studied and defined the declarative ... operational semantics of sequences of logic programs (or dynamic logic programs...
  • YAP-Prolog

  • Referenced in 41 articles [sw06948]
  • three important contributions to the logic programming community. First, it describes the main techniques used ... efficient Prolog engine. Second, most logic programming systems have a rather limited indexing algorithm ... parallelism and tabling in a single logic programming system...
  • Smallfoot

  • Referenced in 50 articles [sw09787]
  • separation logic. Separation logic is a program logic for reasoning about programs that manipulate pointer ... tool for checking certain lightweight separation logic specifications. The assertions describe the shapes of data ... oriented toward novel aspects of separation logic, namely: avoidance of frame axioms (which say what ... pointers; and modular reasoning about concurrent programs...
  • Mercury

  • Referenced in 64 articles [sw08333]
  • combines the clarity and expressiveness of declarative programming with advanced static analysis and error detection ... efficiency far in excess of existing logic programming systems, and close to conventional programming systems...
  • ProbLog

  • Referenced in 61 articles [sw06945]
  • ProbLog is a probabilistic logic programming language based on Prolog. Two ProbLog implementations are available...
  • Aleph

  • Referenced in 37 articles [sw12108]
  • Hypotheses (Aleph). Aleph is an Inductive Logic Programming (ILP) system. This manual is not intended ... Raedt (1994), Inductive Logic Programming: Theory and Methods, Jnl. Logic Programming...
  • PARLOG

  • Referenced in 39 articles [sw23764]
  • programming in logic. PARLOG is a logic programming language in the sense that nearly every ... read as a sentence of predicate logic. It differs from PROLOG in incorporating parallel modes ... PARLOG. It assumes familiarity with logic programming...
  • Curry

  • Referenced in 39 articles [sw08981]
  • truly functional logic language. Functional and logic programming are the most important declarative programming paradigms ... over the last decade. However, integrated functional logic languages are currently not widely used. This ... research efforts of the functional and logic programming communities and to boost declarative programming...
  • Ltur

  • Referenced in 39 articles [sw11689]
  • fundamental problem in the area of logic programming for many reasons. Among these ... design of efficient interpreters for some predicate logic-based languages such as Hornlog ... Gallier and S. Raatz, J. Logic Program. 4, 119-155 (1987; Zbl 0641.68145)]. The present...
  • Lparse

  • Referenced in 37 articles [sw04633]
  • Lparse Smodels works with variable-free programs that are quite cumbersome to generate by hand ... generates a variable-free simple logic program that can be given to smodels. Lparse also ... models) by translating them into normal logic programs...
  • Elf

  • Referenced in 38 articles [sw21361]
  • Meta-Language. Elf is a constraint logic programming language based on the LF Logical Framework ... implementing, and proving properties of programming languages and logics. It has been applied to various...
  • Clingcon

  • Referenced in 29 articles [sw09892]
  • solver for (extended) constraint normal logic programs. It combines the high-level modeling capacities ... Answer Set Programming (ASP) with constraint solving. Constraints over non-linear finite ... integers can be used in the logic programs. The primary clingcon algorithm adopts state...
  • FRIL

  • Referenced in 40 articles [sw18490]
  • probability and fuzzy sets. Extends the logic programming form of knowledge representation and method...
  • ETPS

  • Referenced in 145 articles [sw06302]
  • been used under the name ETPS in logic courses at Carnegie Mellon for a number ... program thus allows students to concentrate on the essential logical problems underlying the proofs ... Peter B. Andrews, An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof ... questions to the teacher without leaving the program. A record of completed exercises is maintained...
  • CiME

  • Referenced in 34 articles [sw09970]
  • Bielefeld university for termination of logic programs; the MU-TERM tool (http://www.dsic.upv.es/ slucas/csr/termination/muterm...
  • LCF

  • Referenced in 139 articles [sw08360]
  • Edinburgh LCF. A mechanized logic of computation. From LCF to HOL: a short history ... original LCF system was a proof-checking program developed at Stanford University by Robin Milner ... proof assistant for higher order logic originally developed for reasoning about hardware.2 The multi-faceted ... proving, but he also designed the ML programming language underlying it and the innovative polymorphic...
  • PRISM

  • Referenced in 29 articles [sw23359]
  • only a probabilistic extension of logic programs but also able to learn from examples with...
  • SALSA

  • Referenced in 30 articles [sw02661]
  • Constraint Programming is recognized as an efficient technique for solving hard combinatorial optimization problems. However ... retaining the original declarativity of Constraint Logic Programming. We propose a language, SALSA, dedicated...
  • FOIL

  • Referenced in 30 articles [sw24694]
  • Induction of logic programs: FOIL and related systems. FOIL is a first-order learning system...
  • OPTYap

  • Referenced in 13 articles [sw13883]
  • applying or-parallelism and tabling to logic programs. Logic programming languages, such as Prolog, provide ... high-level, declarative approach to programming. Logic Programming offers great potential for implicit parallelism, thus ... often limits the potential of the logic programming paradigm. The past years have therefore seen ... parallelism is a natural fit for logic programs with tabling. To substantiate this belief...