Formal Logic Software-Analysis/Programming Language s

Description: cs2053 Formal Logic Software January, 2006 Edition Copyright Arnold Kochman. Other copyrights also apply, including but not limited to the GNU General Public License. This product includes a number of different packages. These are primarily source distributions for Linux/UNIX, and binary for Windows users. Some are relatively simple and some are quite complex. The packages fall broadly into three categories: 1. Applications for simplification and manipulation of logical systems symbolically. 2. Languages for logic programming 3. Libraries to facilitate programming in relation to formal logic systems You will need one of the commonly available unzip utilities, such as PKUNZIP or WinZip or tar, depending upon your system environment. In addition, packages contain documentation, including installation notes, at varying levels of thoroughness, which you will see when you expand the archives in which they are stored. Note that there are various archive formats, which generally are appropriate to the area of applicability of the contents. The CD includes the following: APPLICATIONS qmls - Quine-McCluskey Logic Simplifier - A program to performs logic simplification via the Quine-McCluskey method, by Dannel Albert. It is written in C++ and runs on Windows 95/98/NT/2000/XP and Linux/BSD/UNIX type systems. It is distributed under the terms of the GNU General Public License. DELORES - DEfeasible LOgic REasoning System - A reasoning engine by Tristan Miller. DELORES is a forward-chaining reasoning engine for defeasible logic, an inexpressive but efficient non-monotonic logic. In contrast with most other non-monotonic logics, defeasible logic has linear complexity, allowing DELORES to execute large theories very quickly. DELORES's algorithm extends to general defeasible theories through the use of a pre-processing transformations which eliminate all defeaters and superiority relations. DELORES is distributed pursuant to the GNU General Public License. Kanren - A declarative logic programming system with first-class relations embedded in a pure functional subset of Scheme. The system has true unions, fair scheduling, lexically-scoped logical variables, set-theoretical semantics, and high performance without cuts. Applications of the system range from expert systems to polymorphic type inference and overloading resolution, to model checking and theorem proving. The system can be used as a meta-logic system. It is written in Scheme with a web-based user interface, and purports to be system independent. Kanren is distributed under the MIT/X Consortium License. puzzled - Complex Grid-Type Logic Problem Solver - A program which helps you solve complex grid-type logic problems, by Frederic Demers. It can interpret clues containing comparative information (or, more than, less than, next to), and it has the persistent software preferences characteristic. It comes with a pseudo-English language parser which supports the following relationships: is, is not, more than, less than, next to, not next to, and, or, and shorthand equivalents. puzzled is written in Java and distributed under the GNU General Public License. XSB - A Logic Programming and Deductive Database system for Unix and Windows. It is being developed at the Computer Science Department of the Stony Brook University, in collaboration with Katholieke Universiteit Leuven, Universidade Nova de Lisboa, Uppsala Universitet and XSB, Inc. XSB's tabled resolution is useful for recursive query computation, allowing programs to terminate correctly in many cases where Prolog does not. Users interested in Parsing, Program Analysis, Model-checking, Data Mining and Diagnosis may benefit from XSB. Euler is an inference engine supporting logic based proofs. It is a backward-chaining reasoner enhanced with Euler path detection. There is a 100% Java version and a C# version. Via N3 it is interoperable with W3C Cwm. Euler uses a web-based user interface. Euler is written in C# and Java, and runs on Windows 95/98/NT/2000/XP, and Linux/BSD/UNIX systems. iS - The instance Store - A Java application for performing efficient and scalable Description Logic (DL) reasoning spanning individuals. This kind of reasoning system is important to the vision of the Semantic Web and it is crucial in applications of ontologies in areas such as bioinformatics (gene description) and web service discovery. Applications can potentially engender vast logical systems, exceeding the capabilities of individual reasoners. The iS system applies databases technology to store assertions and information inferred using a DL reasoner. iS can use Oracle, MySQL, or Hypersonic. It is distributed under the GNU Library or Lesser General Public License. Sigma - A knowledge engineering system for developing, viewing and debugging theories in first order logic. It works with Knowledge Interchange Format (KIF) and is optimized for the Suggested Upper Merged Ontology. Sigma includes a number of useful features for knowledge engineering work, including term and hierarchy browsing, the ability to load different files of logical theories, a full first order inference capability with structured proof results, a natural language paraphrase capability for logical axioms, support for displaying mappings to the WordNet lexicon and a number of knowledge base diagnostics. Sigma is written in C++ and Java, and runs under Windows 95/98/NT/2000/XP. It is distributed under the GNU General Public License. There are user interfaces for English, German, Hindi, and Italian language users. Logic-CAI - Logic functions analyzer - An applet that helps teachers or anyone else to perform tasks on logic expressions that would require quite a lot of human time to manage. This program includes conversion from normal notation to polish reverse notation to syntax tree and vice versa. Logic-CAI is written in Java and uses a Web-based user interface. Binary Becky - An artificial intelligence project combining the personality power of AIML with comprehensive logic and reasoning algorithms, concept-oriented language translations and a robust API library for easy plug-in creation. FLUtE - Fuzzy Logic Ultimate Engine - A generic Fuzzy Logic Engine for the .NET Framework. It is written in C# and runs on Windows 95/98/NT/2000/XP. FLUtE is distributed under the GNU Library or Lesser General Public License. PLMan - Propositional Logic Parser - A propositional logic sentence parser/calculator with variable handling capability implemented in Java. PLMan can evaluate formulas under many logical systems. In addition, it can perform a variety of analysis and transformation operations. PLMan addresses a variety of logic systems: Classical two-valued propositional logic (CPL); Kleene three-valued logic (K3); Lukasiewicz three-valued logic (L3); Logic of paradox (LP); R-Mingle three valued logic (RM3); A System of Fuzzy logic (L); Lukasiewicz' continuum-valued logic (LAleph); and First degree entailment as a four-valued logic (FDE). PLMan requires JVM version 1.4 or later. boolmin - BooleanMinimizer - A platform independent application with a graphical user interface to minimize Boolean functions, written by Gregor Mitsch. boolmin offers various algorithms. boolmin is written in C++ and uses GTK+. It runs under Linux/BSD/UNIX, win32, and SunOS/Solaris systems. A GTK+ runtime is supplied for Windows users. boolmin is released under the terms of the GNU Lesser General Public License. Quinessence - A package to perform optimal two-level realization of a boolean function using the classical Quine-McCluskey algorithm. Quinessence is written in Pascal. kmap - Karnaugh Map Minimizer - A program for minimizing boolean functions using Karnaugh maps method. To compile from source code requires WxWidgets toolkit. KMM is written in C++ and compiles with gcc 3.4.2. It can run on Windows 95/98/NT/2000/XP and Linux/BSD/UNIX systems. It is distributed under the GNU General Public License. bfmp - Boolean Function Minimization Program - A platform-independent program written in Perl. It is based on the Quine-McCluskey tabular approach to minimize boolean functions. It supports multiple outputs system and can handle 26-variables minterm. QMC - The Quine McClusky Simplification Tool - A program to optimize boolean equations by using the Quine McClusky process. The input syntax is very easy. It works with a few variables. It is written in C++ and runs under Linux. It is not completely documented. LIBRARIES / MODULES / CLASSES Kniffel - A first order predicate logic library and conversion tools, by Andreas Leitner. Kniffel features a library for dealing with first order predicate logic formulas and tools (command line and CGI versions included) that convert first order predicate logic to LaTeX, graphviz dot, and ASCII formats. It is written in eiffel, and purposrts to be system independent. Kniffel is released under the Eiffel Forum License. MyFuzzy.pm - A fuzzy logic library written in Perl by Roland Stelzer to facilitate the implementation of fuzzy inference systems and fuzzy control systems. In MyFuzzy.pm the fuzzy sets are discrete sets with finite numbers of value pairs,a nd appropriate rounding is applied. The membership values are only defined for this set of natural numbers. mbFuzzIT - Java classses to enable work with Fuzzy logic abd fuzzy inference. mbFuzzIT also includes a visual editor. mbFuzzIT is distributed under the terms of the GNU General Public License. For English and German speaking users. pyfuzzy - A Pythona module for manipulation of fuzzy sets and fuzzy logic operations. The package is distributed under the GNU General Public License. FFLL - Free Fuzzy Logic Library - The Free Fuzzy Logic Library is an open source fuzzy logic class library and API that is optimized for speed critical applications. FFLL is able to load files that adhere to the IEC 61131-7 standard. FFLL was originally released as part of a book, AI Game Programming Wisdom. FFLL is released under the BSD open source license. BoolStuff - A small C++ library for calculating the Disjunctive Normal Form of a boolean expression, written by Pierre Sarrazin. The library also has a C programming interface. It supports a few operations on boolean expression binary trees. A command named booldnf serves as a front end for this library. BoolStuff is written in C/C++ and is distributed under the GNU General Public License. LANGUAGES / DEVELOPMENT ENVIRONMENTS GNU_Prolog - An implementation of the logic programming language PROLOG released under the GNU General Public License. It can compile to native machine code which is extremely fast in execution, and includes a constraint solver. GNU Prolog runs under GNU Prolog can run under Windows 95/98/NT/2000/XP, and Linux/BSD/UNIX type systems. Beside the native-code compilation, GNU Prolog offers a classical interactive interpreter with a debugger. The Prolog part conforms to the ISO standard for Prolog with many useful extensions. Mercury - A logic/functional programming language. The Mercury system includes a compiler, debugger, libraries, sample code, profilers, etc. Mercury is designed to be the successor of logic programming languages such as Prolog. Mercury is written in Java and PHP and runs on Windows 95/98/NT/2000/XP and Linux/BSD/UNIX systems. It is distributed under the BSD License, the GNU General Public License, and the GNU Library or Lesser General Public License. TyRuBa - A logic-meta-programming system which was designed to be used for generating Java code. It was implemented by Kris De Volder. TyRuBa's name is an acronym for 'Type Rule Base'. However, the system has no specific built-in features which make it focus on types. Rather it is a general, simple logic programming language with a few peculiarities to facilitate the manipulation of Java code for the purpose of code generation. TyRuBa is also written in Java and is therefore relatively system independent. It is released under the BSD License. Jason - An interpreter for an extended version of AgentSpeak, a BDI (Beliefs-Desires-Intentions) agent-oriented logic programming language, and is implemented in Java. Using SACI, a multi-agent system can be distributed over a network effortlessly. Jason was developed by Rafael H. Bordini and Jomi F. Hubner, initially based on a model developed by Rafael H. Bordini and Willem Visser, as part of a joint project with Michael Fisher and Mike Wooldridge. The interpreter implements the operational semantics given by Alvaro F. Moreira, Renata Vieira, and Rafael H. Bordini, and draws on ideas and experience from many colleagues, in particular: Rodrigo Machado, Rafael de O. Jannone, Daniel M. Basso, Fabio Y. Okuyama, and Denise de Oliveira. Jason is implemented in Java, and is distributed under GNU Library or Lesser General Public License. ccide - Decision Table Code Generator - A Decision Table code generator. ccide reads a source program containing embedded decision tables, (condition and action entries and stubs) and produces a new source program containing the expanded decision table logic. ccide is written in C, C++, Unix Shell script. It is distributed under the GNU General Public License and the GNU Library or Lesser General Public License. TOY - A constraint functional logic system, designed to support the main declarative programming styles and their combination. It has been designed and developed mainly by the Declarative Programming Group at the Universidad Complutense de Madrid and in collaboration and inputs from the Universidad de Malaga, following previous experiences with the design of declarative languages. TOY supports computations in Haskell style, non-deterministic function, higher-order patterns, a polymorphic type system, constraints with symbolic equations and disequations, linear arithmetic constraints over real numbers, and finite domain constraints. The system also offers declarative debugging facilities, a module system, monadic I/O, and a graphical programming environment. TOY can be used from a Sicstus Prolog environment (version 3.8.4 or later running on most common operating systems), or with the provided executables (for SunOS54 and Windows). TOY licensing comes from the ideas of the Free Software Foundation, and it is distributed under the GNU General Public License. Cigol - logic, spelled backwards - A scripting language designed to solve deductive logic problems. It is designed to be run from the command line or embedded inside an application. There is also a (limited) Cigol applet. Cigol also has applications to AI, graph theory, automata, and database manipulation. Cigol is written in Java and runs as a daemon. It is distributed under the GNU General Public License. HOL - Higher Order Logic - A programming environment developed by Michael Norrish. In HOL, theorems can be proved and proof tools implemented. Built-in decision procedures and theorem provers can automatically establish many simple theorems. An Oracle mechanism gives access to external programs such as SAT and BDD engines. HOL 4 is particularly suitable as a platform for implementing combinations of deduction, execution, and property checking. HOL runs under Windows NT/2000/XP and POSIX environments. I believe this software to be useful, but naturally, I cannot give assurances about the suitability of any package for a particular purpose.

Price: 18 USD

Location: Jerusalem

End Time: 2024-09-26T09:09:49.000Z

Shipping Cost: 0 USD