A defeasible logic programming system for the Web

2005 ◽  
Author(s):  
G. Antoniou ◽  
A. Bikakis ◽  
G. Wagner
Keyword(s):  
Logic Programming ◽  
Programming System ◽  
Defeasible Logic ◽  
The Web

An Inductive Logic Programming-Based Approach for Ontology Population from the Web

2013 ◽  
pp. 319-326 ◽  
Author(s):  
Rinaldo Lima ◽  
Bernard Espinasse ◽  
Hilário Oliveira ◽  
Rafael Ferreira ◽  
Luciano Cabral ◽  
...  
Keyword(s):  
Logic Programming ◽  
Inductive Logic Programming ◽  
Inductive Logic ◽  
Ontology Population ◽  
The Web

scholarly journals Modular action language

2015 ◽  
Vol 16 (2) ◽  
pp. 189-235 ◽  
Author(s):  
DANIELA INCLEZAN ◽  
MICHAEL GELFOND
Keyword(s):  
Logic Programming ◽  
Medium Size ◽  
Programming System ◽  
Problem Structuring ◽  
System Description ◽  
Action Languages ◽  
Special Cases ◽  
Action Language ◽  
Stepwise Development ◽  
High Level

AbstractThe paper introduces a new modular action language,${\mathcal ALM}$, and illustrates the methodology of its use. It is based on the approach of Gelfond and Lifschitz (1993,Journal of Logic Programming 17, 2–4, 301–321; 1998,Electronic Transactions on AI 3, 16, 193–210) in which a high-level action language is used as a front end for a logic programming system description. The resulting logic programming representation is used to perform various computational tasks. The methodology based on existing action languages works well for small and even medium size systems, but is not meant to deal with larger systems that requirestructuring of knowledge.$\mathcal{ALM}$is meant to remedy this problem. Structuring of knowledge in${\mathcal ALM}$is supported by the concepts ofmodule(a formal description of a specific piece of knowledge packaged as a unit),module hierarchy, andlibrary, and by the division of a system description of${\mathcal ALM}$into two parts:theoryandstructure. Atheoryconsists of one or more modules with a common theme, possibly organized into a module hierarchy based on adependency relation. It contains declarations of sorts, attributes, and properties of the domain together with axioms describing them.Structuresare used to describe the domain's objects. These features, together with the means for defining classes of a domain as special cases of previously defined ones, facilitate the stepwise development, testing, and readability of a knowledge base, as well as the creation of knowledge representation libraries.

scholarly journals Defeasible logic versus Logic Programming without Negation as Failure

2000 ◽  
Vol 42 (1) ◽  
pp. 47-57 ◽  
Author(s):  
G. Antoniou ◽  
M.J. Maher ◽  
D. Billington
Keyword(s):  
Logic Programming ◽  
Defeasible Logic ◽  
Negation As Failure

ECLiPSe – From LP to CLP

2011 ◽  
Vol 12 (1-2) ◽  
pp. 127-156 ◽  
Author(s):  
JOACHIM SCHIMPF ◽  
KISH SHEN
Keyword(s):  
Logic Programming ◽  
Constraint Programming ◽  
Combinatorial Problem ◽  
Third Party ◽  
Programming System ◽  
Development Environment ◽  
Control Language ◽  
Extended Prolog ◽  
High Level ◽  
And Control

AbstractECLiPSe is a Prolog-based programming system, aimed at the development and deployment of constraint programming applications. It is also used for teaching most aspects of combinatorial problem solving, for example, problem modelling, constraint programming, mathematical programming and search techniques. It uses an extended Prolog as its high-level modelling and control language, complemented by several constraint solver libraries, interfaces to third-party solvers, an integrated development environment and interfaces for embedding into host environments. This paper discusses language extensions, implementation aspects, components, and tools that we consider relevant on the way from Logic Programming to Constraint Logic Programming.

Developing Rule-Based Applications for the Web

2011 ◽  
pp. 456-477 ◽  
Author(s):  
Vassilis Papataxiarhis ◽  
Vassileios Tsetsos ◽  
Isambo Karali ◽  
Panagiotis Stamatopoulos
Keyword(s):  
Knowledge Representation ◽  
Comparative Study ◽  
Logic Programming ◽  
Web Applications ◽  
Distributed Applications ◽  
Rule Based ◽  
The Web

Embedding rules into Web applications, and distributed applications in general, seems to constitute a significant task in order to accommodate desired expressivity features in such environments. Various methodologies and reasoning modules have been proposed to manage rules and knowledge on the Web. The main objective of the chapter is to survey related work in this area and discuss relevant theories, methodologies and tools that can be used to develop rule-based applications for the Web. The chapter deals with both ways that have been formally defined for modeling a domain of interest: the first based on standard logics while the second one stemmed from the logic programming perspective. Furthermore, a comparative study that evaluates the reasoning engines and the various knowledge representation methodologies, focusing on rules, is presented.

Sign in / Sign up

Export Citation Format

Share Document