|
HiLog
HiLog is a programming logic with higher-order syntax, which allows arbitrary terms to appear in predicate and function positions. However, the model theory of HiLog is first-order. Although syntactically HiLog strictly extends first order logic, HiLog can be embedded into this logic. HiLog was first described in 1989. It was later extended in the direction of many-sorted logic. The XSB system parses HiLog syntax, but the integration of HiLog into XSB is only partial. In particular, HiLog is not integrated with the XSB module system. A full implementation of HiLog is available in the Flora-2 system. It has been shown that HiLog can be embedded into first-order logic through a fairly simple transformation. For instance, p(X)(Y,Z(V)(W)) gets embedded as the following first-order term: apply(p(X),Y,apply(apply(Z,V),W)). The Framework for Logic-Based Dialects (RIF-FLD) of the Rule Interchange Format (RIF) is largely based on the ideas underlying HiLog and F-logic. Examples In a ... [...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] |
Logic Programming
Logic programming is a programming, database and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical form, representing knowledge about some problem domain. Computation is performed by applying logical reasoning to that knowledge, to solve problems in the domain. Major logic programming language families include Prolog, Answer Set Programming (ASP) and Datalog. In all of these languages, rules are written in the form of ''clauses'': :A :- B1, ..., Bn. and are read as declarative sentences in logical form: :A if B1 and ... and Bn. A is called the ''head'' of the rule, B1, ..., Bn is called the ''body'', and the Bi are called '' literals'' or conditions. When n = 0, the rule is called a ''fact'' and is written in the simplified form: :A. Queries (or goals) have the same syntax as the bodies of rules and are commonly written in the form: :?- B1, ..., Bn. In the simplest case of Horn clauses (or "definite" clauses), all ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prolog
Prolog is a logic programming language that has its origins in artificial intelligence, automated theorem proving, and computational linguistics. Prolog has its roots in first-order logic, a formal logic. Unlike many other programming languages, Prolog is intended primarily as a declarative programming language: the program is a set of facts and Horn clause, rules, which define Finitary relation, relations. A computation is initiated by running a ''query'' over the program. Prolog was one of the first logic programming languages and remains the most popular such language today, with several free and commercial implementations available. The language has been used for automated theorem proving, theorem proving, expert systems, term rewriting, type systems, and automated planning, as well as its original intended field of use, natural language processing. See also Watson (computer). Prolog is a Turing-complete, general-purpose programming language, which is well-suited for inte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
F-logic
F-logic (Frame logic) is a knowledge representation and ontology language. It combines the advantages of conceptual modeling with Object-oriented programming, object-oriented, Frame (artificial intelligence), frame-based languages, and offers a Declarative programming, declarative, compact and simple Syntax (programming languages), syntax, and the well-defined semantics of a logic programming language. Features include, among others, object identity, complex objects, Inheritance (object-oriented programming), inheritance, Polymorphism (computer science), polymorphism, query methods, Encapsulation (computer programming), encapsulation. F-logic stands in the same relationship to object-oriented programming as classical relational calculus stands to relational database programming. Overview F-logic was developed by Michael Kifer at Stony Brook University and Georg Lausen at the University of Mannheim. F-logic was originally developed for deductive databases, but is now used most often ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics. Logic studies arguments, which consist of a set of premises that leads to a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" leading to the conclusion "I don't have to wor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic Programming Languages
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics. Logic studies arguments, which consist of a set of premises that leads to a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" leading to the conclusion "I don't have to work. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fundamenta Informaticae
''Fundamenta Informaticae'' is a peer-reviewed scientific journal covering computer science. The editor-in-chief is Bartek Klin. It was established in 1977 by the Polish Mathematical Society as Series IV of the '' Annales Societatis Mathematicae Polonae'', with its main focus on theoretical foundations of computer science. The journal is currently hosted on the Episciences.org platform of the Center for direct scientific communication, and published by IOS Press under the auspices of the European Association for Theoretical Computer Science The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer scientists as well as .... Further reading * Janusz Kowalski, 2004The Polish Mathematical Society (PTM) ''European Mathematical Society Newsletter'' 54:24-29. External links * Computer science journals Theoretica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Term (logic)
In mathematical logic, a term denotes a mathematical object while a formula denotes a mathematical fact. In particular, terms appear as components of a formula. This is analogous to natural language, where a noun phrase refers to an object and a whole sentence refers to a fact. A first-order term is recursively constructed from constant symbols, variable symbols, and function symbols. An expression formed by applying a predicate symbol to an appropriate number of terms is called an atomic formula, which evaluates to true or false in bivalent logics, given an interpretation. For example, is a term built from the constant 1, the variable , and the binary function symbols and ; it is part of the atomic formula which evaluates to true for each real-numbered value of . Besides in logic, terms play important roles in universal algebra, and rewriting systems. Definition Given a set ''V'' of variable symbols, a set ''C'' of constant symbols and sets ''F''''n'' of ''n''-ary ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
LISP
Lisp (historically LISP, an abbreviation of "list processing") is a family of programming languages with a long history and a distinctive, fully parenthesized Polish notation#Explanation, prefix notation. Originally specified in the late 1950s, it is the second-oldest high-level programming language still in common use, after Fortran. Lisp has changed since its early days, and many Programming language dialect, dialects have existed over its history. Today, the best-known general-purpose Lisp dialects are Common Lisp, Scheme (programming language), Scheme, Racket (programming language), Racket, and Clojure. Lisp was originally created as a practical mathematical notation for computer programs, influenced by (though not originally derived from) the notation of Alonzo Church's lambda calculus. It quickly became a favored programming language for artificial intelligence (AI) research. As one of the earliest programming languages, Lisp pioneered many ideas in computer science, includ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transitive Closure
In mathematics, the transitive closure of a homogeneous binary relation on a set (mathematics), set is the smallest Relation (mathematics), relation on that contains and is Transitive relation, transitive. For finite sets, "smallest" can be taken in its usual sense, of having the fewest related pairs; for infinite sets is the unique minimal element, minimal transitive superset of . For example, if is a set of airports and means "there is a direct flight from airport to airport " (for and in ), then the transitive closure of on is the relation such that means "it is possible to fly from to in one or more flights". More formally, the transitive closure of a binary relation on a set is the smallest (w.r.t. ⊆) transitive relation on such that ⊆ ; see . We have = if, and only if, itself is transitive. Conversely, transitive reduction adduces a minimal relation from a given relation such that they have the same closure, that is, ; however, many differen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical Conjunction
In logic, mathematics and linguistics, ''and'' (\wedge) is the Truth function, truth-functional operator of conjunction or logical conjunction. The logical connective of this operator is typically represented as \wedge or \& or K (prefix) or \times or \cdot in which \wedge is the most modern and widely used. The ''and'' of a set of operands is true if and only if ''all'' of its operands are true, i.e., A \land B is true if and only if A is true and B is true. An operand of a conjunction is a conjunct. Beyond logic, the term "conjunction" also refers to similar concepts in other fields: * In natural language, the denotation of expressions such as English language, English "Conjunction (grammar), and"; * In programming languages, the Short-circuit evaluation, short-circuit and Control flow, control structure; * In set theory, Intersection (set theory), intersection. * In Lattice (order), lattice theory, logical conjunction (Infimum and supremum, greatest lower bound). Notati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Logic Programming
The ''Journal of Logical and Algebraic Methods in Programming'' is a peer-reviewed scientific journal established in 1984. It was originally titled ''The Journal of Logic Programming''; in 2001 it was renamed ''The Journal of Logic and Algebraic Programming'', and in 2014 it obtained its current title. The founding editor-in-chief was J. Alan Robinson. From 1984 to 2000 it was the official journal of the Association of Logic Programming. In 2000, the association and the then editorial board started a new journal under the name ''Theory and Practice of Logic Programming'', published by Cambridge University Press. Elsevier continued the journal with a new editorial board under the title ''Journal of Logic and Algebraic Programming''. According to the ''Journal Citation Reports'', the journal has a 2013 impact factor of 0.383. See also * References External links * ''The Journal of Logic and Algebraic Programming'' Academic journals established in 1984 Computer scienc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
