Association For Logic Programming
   HOME





Association For Logic Programming
The Association for Logic Programming (ALP) was founded in 1986. Its mission is "to contribute to the development of Logic Programming, relate it to other formal sciences, formal and also to humanistic sciences, and to promote its uses in academia and industry all over the world". It manages the International Conference on Logic Programming, oversees the journal ''Theory and Practice of Logic Programming'' (TPLP), and publishes an electronic newsletter. The activities of the Association are directed by an Executive Committee and President, elected by ALP members. The current president is Enrico Pontelli. Here is a list of all presidents: * 2024- Enrico Pontelli at New Mexico State University * 2019-2024 Thomas Eiter (''pro term'' 2019-2020) at Vienna University of Technology * 2014-2019 Torsten Schaub at the University of Potsdam * 2010-2014 Gopal Gupta (computer scientist), Gopal Gupta at the University of Texas, Dallas * 2005-2009 Manuel Hermenegildo at the Technical University ...
[...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]  



MORE