http://www.bibsonomy.org/rss/tag/prologBibSonomy RSS Feed for /tag/prologhttp://xor0110.wordpress.com/2010/06/04/making-the-change-with-prolog-the-bad-the-ugly-and-the-good/jaeschke2011-11-13T18:07:03+01:00ai problem programming prolog solving This dictionary is limited to the Prolog concepts covered in COMP9414 Artificial Intelligence at the University of New South Wales, Sydney.http://www.cse.unsw.edu.au/~billw/prologdict.htmlpanic2011-10-01T02:24:45+02:00Prolog Programming Dictionary Information This dictionary is limited to the Prolog concepts covered in COMP9414 Artificial Intelligence at the University of New South Wales, Sydney.http://www.semanticweb.gr/thea/index.htmlzazi2011-08-19T12:39:16+02:00OWL2 Prolog Reasoning Semantic_Web Semantic_Web_Technology Thea Thea is a SWI Prolog API for processing OWL2 ontologies.http://www.slideshare.net/guest57f623bf/thea-processing-owl-ontologies-an-application-of-logic-programming?src=related_normal&amp;rel=1387006zazi2011-08-19T12:39:16+02:00OWL2 Prolog Reasoning Semantic_Web Semantic_Web_Technology Thea Thea is a SWI Prolog API for processing OWL2 ontologies.http://anql.deri.org/zazi2011-08-19T12:38:57+02:00AnQL Annotated_RDF Annotation Prolog Semantic_Web Semantic_Web_Language http://code.google.com/p/km-rdf/zazi2011-08-19T12:38:36+02:00CTR Henry Linked_Data Music_Ontology P2R Prolog RDF-CTR Semantic_Web Semantic_Web_Framework UriSpace Vamp km-rdf moustaki http://programmingkungfuqi.blogspot.com/draganigajic2011-07-13T18:13:19+02:00lisp prolog qi typeTheory http://www.cs.mu.oz.au/research/mercury/information/comparison_with_haskell.htmldraganigajic2011-07-13T18:13:14+02:00Haskell comparison fp logicProgramming mercury-pl prolog embeds prolog in js python c# using yield iteratorhttp://yieldprolog.sourceforge.net/draganigajic2011-07-13T18:13:10+02:00javascript logic prolog python embeds prolog in js python c# using yield iteratorhttp://logicaltypes.blogspot.com/2008/08/using-difference-lists.htmldraganigajic2011-07-13T18:13:08+02:00*RIL *read blogpost haskell logic programming prolog http://www.j-paine.org/cgi-bin/webcats/webcats.phpdraganigajic2011-07-13T18:12:59+02:00categoryTheory demo jPaine prolog http://web.engr.oregonstate.edu/~erwig/zurg/draganigajic2011-07-13T18:12:48+02:00haskell logic logicProgramming prolog puzzles search zurg http://www.mcs.vuw.ac.nz/courses/COMP304/2007T1/draganigajic2011-07-13T18:12:35+02:00course haskell lectures pl prolog http://alumni.media.mit.edu/~tpminka/PLE/draganigajic2011-07-13T18:12:25+02:00comparison haskell programming prolog python scheme tutorial http://www.dfki.uni-kl.de/~vega/relfun.htmldraganigajic2011-07-13T18:12:08+02:00functional lisp logic programming prolog relational Supported and ongoing software projects: * IsaPlanner - a proof planner for Isabelle * HiGraph - a system for presenting and manipulating hierarchical proofs/graphs generated by proof planning in IsaPlanner. Currently just an editor/drawing tool for the graphs. * Quantomatic - a tool for graphically reasoning about quantum computation using models based on compact closed categories. Older software projects (no longer being developed): * Lambda Clam - a proof planner written in lambda prolog. * HR - an automated theory formation system * Clam proof planner with oyster - a proof planner written in prolog * Clam version 3.2 * HOL-Clam - a link up between the HOL proof assistant and the Clam proof planner. * Anastasia - a structural program editor * Press - a prolog based system for solving symbolic, transcendental, non-differential equationshttp://dream.inf.ed.ac.uk/software/draganigajic2011-07-13T18:12:05+02:00prolog proof software Supported and ongoing software projects: * IsaPlanner - a proof planner for Isabelle * HiGraph - a system for presenting and manipulating hierarch<span class="info">...<div>Supported and ongoing software projects: * IsaPlanner - a proof planner for Isabelle * HiGraph - a system for presenting and manipulating hierarchical proofs/graphs generated by proof planning in IsaPlanner. Currently just an editor/drawing tool for the graphs. * Quantomatic - a tool for graphically reasoning about quantum computation using models based on compact closed categories. Older software projects (no longer being developed): * Lambda Clam - a proof planner written in lambda prolog. * HR - an automated theory formation system * Clam proof planner with oyster - a proof planner written in prolog * Clam version 3.2 * HOL-Clam - a link up between the HOL proof assistant and the Clam proof planner. * Anastasia - a structural program editor * Press - a prolog based system for solving symbolic, transcendental, non-differential equations</div></span>http://www.sics.se/isl/sicstuswww/site/links.htmldraganigajic2011-07-13T18:12:05+02:00links logic programming prolog LambdaCLAM is a tool for automated theorem proving in higher order domains. In particular LambdaCLAM specialises in proof using induction based on the rippling heuristic. LambdaCLAM is a higher-order version of CLAM. Both CLAM and LambdaCLAM use proof planning to guide the search for a proof A proof plan is a proof of a theorem at some level of abstraction presented as a tree. Each node in this tree is justified by a tactic. The exact nature of these tactics is unspecified, they may be sequences of inference rules, programs for generating sequences of inferences or a further proof plan at some lower level of abstraction. In principle while the generation of the proof tree may have involved heuristics and (possibly) unsound inference steps, it can be justified by executing the tactics attached to the nodes.http://dream.dai.ed.ac.uk/software/lambda-clam/draganigajic2011-07-13T18:12:03+02:00prolog proof proofPlanning LambdaCLAM is a tool for automated theorem proving in higher order domains. In particular LambdaCLAM specialises in proof using induction based on the ripp<span class="info">...<div>LambdaCLAM is a tool for automated theorem proving in higher order domains. In particular LambdaCLAM specialises in proof using induction based on the rippling heuristic. LambdaCLAM is a higher-order version of CLAM. Both CLAM and LambdaCLAM use proof planning to guide the search for a proof A proof plan is a proof of a theorem at some level of abstraction presented as a tree. Each node in this tree is justified by a tactic. The exact nature of these tactics is unspecified, they may be sequences of inference rules, programs for generating sequences of inferences or a further proof plan at some lower level of abstraction. In principle while the generation of the proof tree may have involved heuristics and (possibly) unsound inference steps, it can be justified by executing the tactics attached to the nodes.</div></span>Despite Prolog&#039;s logic heritage and its use of theorem-proving unification and resolution operations, Prolog fails to qualify as a full general-purpose theorem-proving system. There are three main reasons: (1) many Prolog systems use an unsound unification algorithm, (2) Prolog&#039;s unbounded depth-first search strategy is incomplete, and (3) Prolog&#039;s inference system is not complete for non-Horn clauses. Nevertheless, Prolog is quite interesting from a theorem-proving standpoint because of its very high inference rate as compared to conventional theorem-proving programs. The objective of the Prolog Technology Theorem Prover (PTTP) is to overcome the deficiencies while retaining as fully as possible the high performance of well-engineered Prolog systems.http://www.ai.sri.com/~stickel/pttp.htmldraganigajic2011-07-13T18:12:02+02:00automatedTheorem lisp logic prolog Despite Prolog&#039;s logic heritage and its use of theorem-proving unification and resolution operations, Prolog fails to qualify as a full general-purpose the<span class="info">...<div>Despite Prolog&#039;s logic heritage and its use of theorem-proving unification and resolution operations, Prolog fails to qualify as a full general-purpose theorem-proving system. There are three main reasons: (1) many Prolog systems use an unsound unification algorithm, (2) Prolog&#039;s unbounded depth-first search strategy is incomplete, and (3) Prolog&#039;s inference system is not complete for non-Horn clauses. Nevertheless, Prolog is quite interesting from a theorem-proving standpoint because of its very high inference rate as compared to conventional theorem-proving programs. The objective of the Prolog Technology Theorem Prover (PTTP) is to overcome the deficiencies while retaining as fully as possible the high performance of well-engineered Prolog systems.</div></span>http://akira.ruc.dk/~henning/hyprolog/draganigajic2011-07-13T18:11:36+02:00abduction chr prolog