|
Semantic Reasoner
A semantic reasoner, reasoning engine, rules engine, or simply a reasoner, is a piece of software able to infer logical consequences from a set of asserted facts or axioms. The notion of a semantic reasoner generalizes that of an inference engine, by providing a richer set of mechanisms to work with. The inference rules are commonly specified by means of an ontology language, and often a description logic language. Many reasoners use first-order predicate logic to perform reasoning; inference commonly proceeds by forward chaining and backward chaining. There are also examples of probabilistic reasoners, including non-axiomatic reasoning systems, and probabilistic logic networks. Notable applications Notable semantic reasoners and related software: Free to use (closed source) * Cyc inference engine, a forward and backward chaining inference engine with numerous specialized modules for high-order logic. * KAON2 is an infrastructure for managing OWL-DL, SWRL, and F-L ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical Consequence
Logical consequence (also entailment or logical implication) is a fundamental concept in logic which describes the relationship between statement (logic), statements that hold true when one statement logically ''follows from'' one or more statements. A Validity (logic), valid logical argument is one in which the Consequent, conclusion is entailed by the premises, because the conclusion is the consequence of the premises. The philosophical analysis of logical consequence involves the questions: In what sense does a conclusion follow from its premises? and What does it mean for a conclusion to be a consequence of premises?Beall, JC and Restall, Greg, Logical Consequence' The Stanford Encyclopedia of Philosophy (Fall 2009 Edition), Edward N. Zalta (ed.). All of philosophical logic is meant to provide accounts of the nature of logical consequence and the nature of logical truth. Logical consequence is logical truth, necessary and Formalism (philosophy of mathematics), formal, by wa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Drools
Drools is a business rule management system (BRMS) with a forward and backward chaining inference-based rules engine, more correctly known as a production rule system, using an enhanced implementation of the Rete algorithm. Drools supports the Java Rules Engine API (Java Specification Request 94) standard for its business rule engine and enterprise framework for the construction, maintenance, and enforcement of business policies in an organization, application, or service. Drools in Apache Kie Drools, as part of the Kie Community has entered Apache Incubator in January, 2023. Red Hat Decision Manager Red Hat Decision Manager (formerly Red Hat JBoss BRMS) is a business rule management system and reasoning engine for business policy and rules development, access, and change management. JBoss Enterprise BRMS is a productized version of Drools with enterprise-level support available. JBoss Rules is also a productized version of Drools, but JBoss Enterprise BRMS is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doxastic Logic
Doxastic logic is a type of logic concerned with reasoning about beliefs. The term ' derives from the Ancient Greek (''doxa'', "opinion, belief"), from which the English term ''doxa'' ("popular opinion or belief") is also borrowed. Typically, a doxastic logic uses the notation \mathcal_c x to mean "reasoner c believes that x is true", and the set \mathbb_c : \left \ denotes the set of beliefs of c. In doxastic logic, belief is treated as a modal operator. There is complete parallelism between a person who believes propositions and a formal system that derives propositions. Using doxastic logic, one can express the epistemic counterpart of Gödel's incompleteness theorem of metalogic, as well as Löb's theorem, and other metalogical results in terms of belief. Smullyan, Raymond M., (1986''Logicians who reason about themselves'' Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge, Monterey (CA), Morgan Kaufmann Publishers Inc., San Francis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Business Rules Engine
A business rules engine is a software system that executes one or more business rules in a runtime production environment. The rules might come from legal regulation ("An employee can be fired for any reason or no reason but not for an illegal reason"), company policy ("All customers that spend more than $100 at one time will receive a 10% discount"), or other sources. A business rule system enables these company policies and other operational decisions to be defined, tested, executed and maintained separately from application code. Rule engines typically support rules, facts, priority (score), mutual exclusion, preconditions, and other functions. Rule engine software is commonly provided as a component of a business rule management system which, among other functions, provides the ability to: register, define, classify, and manage all the rules, verify consistency of rules definitions (”Gold-level customers are eligible for free shipping when order quantity > 10” and “ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Preferential Entailment
Preferential entailment is a non-monotonic logic based on selecting only models that are considered the most plausible. The plausibility of models is expressed by an ordering among models called a preference relation, hence the name preference entailment. Formally, given a propositional formula F and an ordering over propositional models \leq, preferential entailment Logical consequence (also entailment or logical implication) is a fundamental concept in logic which describes the relationship between statements that hold true when one statement logically ''follows from'' one or more statements. A valid l ... selects only the models of F that are minimal according to \leq. This selection leads to a non-monotonic inference relation: F \models_\text G holds if and only if all minimal models of F according to \leq are also models of G.. Circumscription can be seen as the particular case of preferential entailment when the ordering is based on containment of the sets of variabl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Protégé (software)
Protégé is a free, open source ontology editor and a knowledge management system. The Protégé meta-tool was first built by Mark Musen in 1987 and has since been developed by a team at Stanford University. The software is the most popular and widely used ontology editor in the world. Overview Protégé provides a graphical user interface to define ontologies. It also includes deductive classifiers to validate that models are consistent and to infer new information based on the analysis of an ontology. Like Eclipse, Protégé is a framework for which various other projects suggest plugins. This application is written in Java and makes heavy use of Swing to create the user interface. According to their website, there are over 300,000 registered users. A 2009 book calls it "the leading ontological engineering tool". Protégé is developed at Stanford University and is made available under the BSD 2-clause license. Earlier versions of the tool were developed in collaboration wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Web Ontology Language
The Web Ontology Language (OWL) is a family of Knowledge representation and reasoning, knowledge representation languages for authoring Ontology (information science), ontologies. Ontologies are a formal way to describe Taxonomy, taxonomies and classification networks, essentially defining the structure of knowledge for various domains: the nouns representing classes of objects and the verbs representing relations between the objects. Ontologies resemble class hierarchies in object-oriented programming but there are several critical differences. Class hierarchies are meant to represent structures used in source code that evolve fairly slowly (perhaps with monthly revisions) whereas ontologies are meant to represent information on the Internet and are expected to be evolving almost constantly. Similarly, ontologies are typically far more flexible as they are meant to represent information on the Internet coming from all sorts of heterogeneous data sources. Class hierarchies on the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prova
{{other uses Prova is an open source programming language that combines Prolog with Java. Description Prova is a rule-based scripting system that is used for middleware. The language combines imperative and declarative programming by using a prolog syntax that allows calls to Java functions. In this way a strong Java code base is combined with Prolog features such as backtracking. Prova is derived from Mandarax, a Java-based inference system developed by Jens Dietrich. Prova extends Mandarax by providing a proper language syntax, native syntax integration with Java, agent messaging and reaction rules. The development of this language was supported by the grant provided within the EU projects GeneStream and BioGRID. In the project, the language is used as a rule-based backbone for distributed web applications in biomedical data integration, in particular, the GoPubMed system. The design goals of Prova: * Combine declarative and object-oriented programming. * Expose logic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
C Sharp (programming Language)
C# ( pronounced: C-sharp) ( ) is a general-purpose high-level programming language supporting multiple paradigms. C# encompasses static typing, strong typing, lexically scoped, imperative, declarative, functional, generic, object-oriented (class-based), and component-oriented programming disciplines. The principal inventors of the C# programming language were Anders Hejlsberg, Scott Wiltamuth, and Peter Golde from Microsoft. It was first widely distributed in July 2000 and was later approved as an international standard by Ecma (ECMA-334) in 2002 and ISO/ IEC (ISO/IEC 23270 and 20619) in 2003. Microsoft introduced C# along with .NET Framework and Microsoft Visual Studio, both of which are technically speaking, closed-source. At the time, Microsoft had no open-source products. Four years later, in 2004, a free and open-source project called Microsoft Mono began, providing a cross-platform compiler and runtime environment for the C# programming language. A decad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jena (framework)
Apache Jena is an open source Semantic Web framework for Java. It provides an API to extract data from and write to RDF graphs. The graphs are represented as an abstract "model". A model can be sourced with data from files, databases, URLs or a combination of these. A model can also be queried through SPARQL 1.1. Jena is similar to RDF4J (formerly OpenRDF Sesame); though, unlike RDF4J, Jena provides support for OWL (Web Ontology Language). The framework has various internal reasoners and the Pellet reasoner (an open source Java OWL-DL reasoner) can be set up to work in Jena. Jena supports serialisation of RDF graphs to: *a relational database *RDF/XML *Turtle * TriG *Notation 3 *JSON-LD Versions After Apache integration Jena was integrated as a project under the umbrella of The Apache Software Foundation in April 2012, after having been in the Apache Incubator since November 2010. Before Apache integration Jena was created by HP Labs and was on SourceForge since 2001, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Flora-2
Flora-2 is an open source semantic rule-based system for knowledge representation and reasoning. The language of the system is derived from F-logic, HiLog, W. Chen, M. Kifer and D.S. Warren (1993)''HiLog: A Foundation for Higher-Order Logic Programming'' Journal of Logic Programming, 1993. and Transaction logic.A.J. Bonner and M. Kifer (1993), ''Transaction Logic Programming'', International Conference on Logic Programming (ICLP), 1993. Being based on F-logic and HiLog implies that object-oriented syntax and higher-order representation are the major features of the system. Flora-2 also supports a form of defeasible reasoning called ''Logic Programming with Defaults and Argumentation Theories'' (LPDA). Applications include intelligent agents, Semantic Web, knowledge-bases networking, ontology management, integration of information, security policy analysis, automated database normalization, and more. Flora-2 relies on the XSB system for its inference engine. The design and archit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Expert Systems
In artificial intelligence (AI), an expert system is a computer system emulating the decision-making ability of a human expert. Expert systems are designed to solve complex problems by Automated reasoning system, reasoning through bodies of knowledge, represented mainly as Rule-based system, if–then rules rather than through conventional procedural programming code. Expert systems were among the first truly successful forms of AI software. They were created in the 1970s and then proliferated in the 1980s, being then widely regarded as the future of AI — before the advent of successful artificial neural networks. An expert system is divided into two subsystems: 1) a ''knowledge base'', which represents facts and rules; and 2) an ''inference engine'', which applies the rules to the known facts to deduce new facts, and can include explaining and debugging abilities. History Early development Soon after the dawn of modern computers in the late 1940s and early 1950s, researche ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
