Home
Music_Metasearch
Music Top Sites
Music Store
AllMusicListings
Concert Listings
Concert Tickets
AllMusicTalk
Chat Rooms
Message Boards
MusicNews
Pop Music News
Pop Music Reviews
Music Business
MP3 News
Community
Blogs
Free Member Blogs
AllMusicPages
Free Web Pages
AllMusicBookmarks
Your Bookmarks
AllMusicFun
Musical Postcards
Relationship Test
Tarot Readings
Numerology
Music Auctions
Auctions
Classifieds
Music Apparel
AllMusicSearch Apparel
Music Store
MP3 Players
Audio Equipment
MP3 Software
Musical Instruments
Music Books
Music Magazines
Music T-Shirts
Alternative Rock
Blues
Broadway & Vocal
Children's
Christian & Gospel
Classic Rock
Classical
Country
Dance & DJ
Folk
Hard Rock & Metal
International
Jazz
Latin Music
Miscellaneous
New Age
Opera & Vocal
Pop
R&B
Rap & Hip-Hop
Rock
Soundtracks
Music Videos
Music DVDs
Software (25)
See Also:
Sites:
» ACL2 Version 2.7 
A programming language in which you can model computer systems and a tool to help prove properties of those models. Available under GPL and runs on various platforms. Includes related download links.
http://www.cs.utexas.edu/users/moore/acl2/
A programming language in which you can model computer systems and a tool to help prove properties of those models. Available under GPL and runs on various platforms. Includes related download links.
http://www.cs.utexas.edu/users/moore/acl2/
» Automated Reasoning Project
Web resource provided by research group. Includes access to software developed by the team, covering such projects as FINDER (Finite Domain Enumerator), MaGIC (Matrix Generator for Implication Connectives) and Kripke (A theorem prover for the relevant log
http://cslab.anu.edu.au/ar/
Web resource provided by research group. Includes access to software developed by the team, covering such projects as FINDER (Finite Domain Enumerator), MaGIC (Matrix Generator for Implication Connectives) and Kripke (A theorem prover for the relevant log
http://cslab.anu.edu.au/ar/
» Bertrand
Bertrand solves sets of first-order predicate logic statements for satisfiability (consistency), validity, and equivalence. It also checks single statements for "logical truth" (tautology) and "logical falsity" (self-contradiction). Subject-identity is su
http://www.uwosh.edu/faculty_staff/herzberg/Bertrand.html
Bertrand solves sets of first-order predicate logic statements for satisfiability (consistency), validity, and equivalence. It also checks single statements for "logical truth" (tautology) and "logical falsity" (self-contradiction). Subject-identity is su
http://www.uwosh.edu/faculty_staff/herzberg/Bertrand.html
» Church
Program understands the different types of lambda expressions, can extract lists of variables (both free and bound) and subterms, and can simplify complicated expressions. Uses Python.
http://www.alcyone.com/software/church/
Program understands the different types of lambda expressions, can extract lists of variables (both free and bound) and subterms, and can simplify complicated expressions. Uses Python.
http://www.alcyone.com/software/church/
» CrocoPat: Simple and Efficient Relational Programming
CrocoPat manipulates relations of any arity, including graphs (which are binary relations). Its simple and expressive query and manipulation language is based on first-order predicate calculus. The implementation is based on the data structure binary deci
http://mtc.epfl.ch/~beyer/CrocoPat/
CrocoPat manipulates relations of any arity, including graphs (which are binary relations). Its simple and expressive query and manipulation language is based on first-order predicate calculus. The implementation is based on the data structure binary deci
http://mtc.epfl.ch/~beyer/CrocoPat/
» DC Proof Online
New proof-writing software to teach the fundamentals of logic and proof. Enables users/students to write error-free proofs by selecting rules of inference, axioms, etc. from convenient drop-down menus. Includes tutorial and exercises.
http://www.dcproof.com
New proof-writing software to teach the fundamentals of logic and proof. Enables users/students to write error-free proofs by selecting rules of inference, axioms, etc. from convenient drop-down menus. Includes tutorial and exercises.
http://www.dcproof.com
» DELORES
A forward-chaining reasoning engine for defeasible logic, a less expressive but more efficient nonmonotonic logic.
http://www.dfki.uni-kl.de/~miller/delores/
A forward-chaining reasoning engine for defeasible logic, a less expressive but more efficient nonmonotonic logic.
http://www.dfki.uni-kl.de/~miller/delores/
» Database of Existing Mechanized Reasoning Systems
A list (over 50 entries) of automatic resolution provers (like Otter), interactive provers (like PVS) and other mechanized reasoning tools.
http://www-formal.stanford.edu/clt/ARS/systems.html
A list (over 50 entries) of automatic resolution provers (like Otter), interactive provers (like PVS) and other mechanized reasoning tools.
http://www-formal.stanford.edu/clt/ARS/systems.html
» Gateway to Logic
A collection of web-based logic programs offering a number of logical functions: interactively or automatically build proofs, check theorems, and operate on propositional logic formulae.
http://logik.phl.univie.ac.at/~chris/formular-uk.html
A collection of web-based logic programs offering a number of logical functions: interactively or automatically build proofs, check theorems, and operate on propositional logic formulae.
http://logik.phl.univie.ac.at/~chris/formular-uk.html
» Isabelle
A generic theorem proving environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). Includes logic, documentation and free download.
http://www.cl.cam.ac.uk/Research/HVG/Isabelle/
A generic theorem proving environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). Includes logic, documentation and free download.
http://www.cl.cam.ac.uk/Research/HVG/Isabelle/
» LOOM
A language and environment for constructing intelligent applications. It is a research project in the Artificial Intelligence research group at the University of Southern California's Information Sciences Institute. The goal of the project is to develop a
http://www.isi.edu/isd/LOOM/LOOM-HOME.html
A language and environment for constructing intelligent applications. It is a research project in the Artificial Intelligence research group at the University of Southern California's Information Sciences Institute. The goal of the project is to develop a
http://www.isi.edu/isd/LOOM/LOOM-HOME.html
» Logic Software from CSLI
By Jon Barwise and John Etchemendy.
http://www-csli.stanford.edu/hp/Logic-software.html
By Jon Barwise and John Etchemendy.
http://www-csli.stanford.edu/hp/Logic-software.html
» MUltlog
Takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and clause formation rules for this logic.
http://www.logic.at/multlog/
Takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and clause formation rules for this logic.
http://www.logic.at/multlog/
» MUltseq
A generic sequent prover for propositional finitely-valued logics.
http://www.logic.at/multseq/
A generic sequent prover for propositional finitely-valued logics.
http://www.logic.at/multseq/
» PVS
The PVS Specification and Verification System. Available for Sparc machines with Solaris 2 and Intel x86 Machines with Linux compatible with Redhat 5 or later. Required is Emacs (version 19 or later), recommended LaTeX and Tcl/Tk. Download by FTP.
http://pvs.csl.sri.com/
The PVS Specification and Verification System. Available for Sparc machines with Solaris 2 and Intel x86 Machines with Linux compatible with Redhat 5 or later. Required is Emacs (version 19 or later), recommended LaTeX and Tcl/Tk. Download by FTP.
http://pvs.csl.sri.com/
» Paradox
A tool that processes first-order logic problems and tries to find finite-domain models for them; written by Koen Claessen and Niklas Sörensson. Haskell and C++; free download under GPL.
http://www.cs.chalmers.se/~koen/paradox/
A tool that processes first-order logic problems and tries to find finite-domain models for them; written by Koen Claessen and Niklas Sörensson. Haskell and C++; free download under GPL.
http://www.cs.chalmers.se/~koen/paradox/
» Proof General
Comprehensive Gnu-Emacs and XEmacs interface for several theorem provers including Coq, Isabelle, Lego, and Phox.
http://proofgeneral.inf.ed.ac.uk
Comprehensive Gnu-Emacs and XEmacs interface for several theorem provers including Coq, Isabelle, Lego, and Phox.
http://proofgeneral.inf.ed.ac.uk
» ProofPower
A suite of tools supporting specification and proof in Higher Order Logic (HOL) and in Z notation.
http://www.lemma-one.com/ProofPower/index/
A suite of tools supporting specification and proof in Higher Order Logic (HOL) and in Z notation.
http://www.lemma-one.com/ProofPower/index/
» Spreadsheet Logic
Free Microsoft Excel add-in for processing and evaluating logic in your spreadhseet.
http://members.multimania.co.uk/jbusar/
Free Microsoft Excel add-in for processing and evaluating logic in your spreadhseet.
http://members.multimania.co.uk/jbusar/
» Tree Proof Generator
An implementation of the semantic tableaux method for classical propositional and predicate logic, written in JavaScript/DOM.
http://www.umsu.de/logik/trees
An implementation of the semantic tableaux method for classical propositional and predicate logic, written in JavaScript/DOM.
http://www.umsu.de/logik/trees
» VeriFun
A semi-automated system for the verification of statements about programs written in a functional programming language. The system is capable of following fully-automated routines for theorem proving and hypotheses formation, as well as operating interact
http://www.informatik.tu-darmstadt.de/pm/verifun/
A semi-automated system for the verification of statements about programs written in a functional programming language. The system is capable of following fully-automated routines for theorem proving and hypotheses formation, as well as operating interact
http://www.informatik.tu-darmstadt.de/pm/verifun/
» WinKE
An interactive proof assistant based on analytic tableaux, and designed for the teaching of deductive reasoning. Ordering information is available at this site, as are academic papers on the design of the software.
http://staff.science.uva.nl/~ulle/WinKE/
An interactive proof assistant based on analytic tableaux, and designed for the teaching of deductive reasoning. Ordering information is available at this site, as are academic papers on the design of the software.
http://staff.science.uva.nl/~ulle/WinKE/
» j'Imp Theorem Prover
An automatic theorem prover based on set of support and ordered resolution for first-order logic. j'Imp is part of the Orbital library. This library is a Java class providing object-oriented representations and algorithms for logic, mathematics, and artif
http://www.functologic.com/logic/jImp.html
An automatic theorem prover based on set of support and ordered resolution for first-order logic. j'Imp is part of the Orbital library. This library is a Java class providing object-oriented representations and algorithms for logic, mathematics, and artif
http://www.functologic.com/logic/jImp.html
» llprover
A linear logic prover that searches a cut-free proof for the given two-sided sequent of first-order linear logic.
http://bach.scitec.kobe-u.ac.jp/llprover/
A linear logic prover that searches a cut-free proof for the given two-sided sequent of first-order linear logic.
http://bach.scitec.kobe-u.ac.jp/llprover/
This category needs an editor
Last Updated: 2009-04-23 15:54:56
|
The content of this directory is based on the Open Directory and has been modified by AllMusicSearch.com editors
Powered by AllMusicSearch.com Copyright © 2000-2014 AllMusicSearch.com Inc Privacy Policy
