• ASSAT

  • Referenced in 173 articles [sw02524]
  • solvers. Briefly speaking, given a ground logic program P, ASSAT(X), depending...
  • lp2normal

  • Referenced in 5 articles [sw25505]
  • lp2normal -- a normalization tool for extended logic programs. Answer set programming (ASP) features a rich ... that acts as a filter on ground logic programs produced by grounders, such as gringo...
  • Gringo

  • Referenced in 105 articles [sw04630]
  • programs provided by users into equivalent propositional logic programs. The answer sets of such programs ... incremental mode that incorporates both grounding and solving. For one, this document aims at enabling...
  • ProbLog

  • Referenced in 86 articles [sw06945]
  • ProbLog is a probabilistic logic programming language based on Prolog. Two ProbLog implementations are available ... compute marginal probabilities of any number of ground atoms in the presence of evidence...
  • VeriFast

  • Referenced in 62 articles [sw07705]
  • abstract representation of memory as a separation logic assertion. Folding or unfolding abstract predicate assertions ... solver while enabling reduction of any ground term. Since no significant search is performed...
  • SCEL

  • Referenced in 17 articles [sw20779]
  • solid semantic grounds of the language is exploited for developing logics, tools and methodologies...
  • ASPTools

  • Referenced in 2 articles [sw33089]
  • disjunctive rules into normal rules; modlist: split logic program into modules; modrun: execute a command ... redundancy of individual rules in a ground logic program (module); rsat: generate a random...
  • GASP

  • Referenced in 15 articles [sw07096]
  • ground version of the program. Grounding is lazily performed during the computation of the answer ... implementation has been realized using Constraint Logic Programming over finite domains...
  • Hornlog

  • Referenced in 6 articles [sw21362]
  • paper a new method is presented for logic- programming interpreters based on graph rewriting ... ground Horn clauses. The method (called Hornlog) applies to a class of logic programs that...
  • DLV-EX

  • Referenced in 16 articles [sw04642]
  • logic programming with function symbols, object oriented logic languages, inter-operability with external sources ... suitable (but, in general, not decidable) `finite grounding property’ is identified, and the class ... Value invention restricted programs have the finite grounding property and can be decided in polynomial ... case in the specific literature about logic programming with function symbols). Relationships with existing formalisms...
  • aleanTAP

  • Referenced in 2 articles [sw09987]
  • declarative theorem prover for first-order classical logic. We present αleanTAP, a declarative tableau-based ... based, αleanTAP can prove ground theorems in first-order classical logic. Since it is declarative ... prover to instantiate non-ground parts of theorems. We present a complete implementation of αleanTAP ... leanTAP into αKanren, an embedding of nominal logic programming in Scheme. We then show...
  • KReator

  • Referenced in 3 articles [sw06946]
  • logic programs, Markov logic networks and relational maximum entropy under grounding semantics. More approaches will ... provide some background on probabilistic inductive logic programming and statistical relational learning and illustrate...
  • ASPeRiX

  • Referenced in 6 articles [sw00050]
  • stable model semantics for normal logic programs. The main specifity of our system ... chaining of first order rules that are grounded on the fly. So, unlike others available...
  • Dungine

  • Referenced in 5 articles [sw22091]
  • grounded (sceptical) and preferred credulous semantics. Existing argumentation engines all rely on a companion logic...
  • modopt

  • Referenced in 2 articles [sw33090]
  • answer set programming, ground programs are used as intermediate representations of logic programs for which...
  • Zsyntax

  • Referenced in 2 articles [sw30123]
  • ζωή, life), is grounded on a particular type of non-classical logic...
  • iProver-Eq

  • Referenced in 8 articles [sw09452]
  • which is complete for first-order logic with equality. iProver-Eq extends the iProver system ... first-order reasoning is combined with efficient ground satisfiability checking where the latter is delegated...
  • kLog

  • Referenced in 4 articles [sw10403]
  • concepts: learning from interpretations, entity/relationship data modeling, logic programming, and deductive databases. Access ... transformed into a graph -- in particular, a grounded entity/relationship diagram. Subsequently, a choice of graph ... Prolog or Datalog programs as in inductive logic programming systems. The kLog framework...
  • IsaFoL

  • Referenced in 4 articles [sw19193]
  • repository contains various ongoing Isabelle formalizations of logical calculi. The goal is to develop lemma ... initial focus is on well-established ground and first-order calculi, such as DPLL, CDCL...
  • Kara

  • Referenced in 5 articles [sw30392]
  • dedicated models, called answer sets, of a logical theory. These answer sets are computed from ... returned to the user as sets of ground first-order literals. As this type...