A Logic Programming Perspective on Rules

2010 ◽  
pp. 195-213
Author(s):  
Leon Sterling ◽  
Kuldar Taveter
Keyword(s):  
Logic Programming ◽  
Logic Program ◽  
Modelling And Simulation ◽  
Rule Based ◽  
Hybrid Computing ◽  
Rule Languages ◽  
The Web

Logic programming emerged from the realization that expressing knowledge in an appropriate clausal form in logic was akin to programming. The basic construct of a logic program can be viewed as a rule. This chapter will review rules from a logic programming perspective with an eye to developments within modern rule languages. It mentions rule interpreters, hybrid computing, interaction with the Web, and agents. An extended example is given concerning rule-based modelling and simulation of traffic at airports.

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.

Modular Rule-Based Promgramming in 2APL

2010 ◽  
pp. 25-49 ◽  
Author(s):  
Medhi Dastani
Keyword(s):  
Markup Language ◽  
Abstract Syntax ◽  
Narrow Sense ◽  
Design Issues ◽  
Markup Languages ◽  
Rule Based ◽  
Common Basis ◽  
Rule Languages ◽  
The Web

Rule markup languages will be the vehicle for using rules on the Web and in other distributed systems. They allow publishing, deploying, executing and communicating rules in a network. They may also play the role of a lingua franca for exchanging rules between different systems and tools. In a narrow sense, a rule markup language is a concrete (XML-based) rule syntax for the Web. In a broader sense, it should have an abstract syntax as a common basis for defining various concrete languages addressing different consumers. The main purposes of a rule markup language are to permit the publication, interchange and reuse of rules. This chapter introduces important requirements and design issues for general Web rule languages to fulfill these tasks. Characteristics of several important general standardization or standards-proposing efforts for (XML-based) rule markup languages including W3C RIF, RuleML, R2ML, SWRL as well as (human-readable) Semantic Web rule languages such as TRIPLE, N3, Jena, and Prova are discussed with respect to these identified issues.

Developing Rule-Based Web Applications

2010 ◽  
pp. 371-392 ◽  
Author(s):  
Vassilis Paptaxiarhis ◽  
Vassileios Tsetsos ◽  
Isambo Karali ◽  
Panagiotis Stamotopoulos
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.

CUT-PROPERTY AND NEGATION AS FAILURE

1994 ◽  
Vol 05 (02) ◽  
pp. 129-164 ◽  
Author(s):  
ROBERT F. STÄRK
Keyword(s):  
Logic Programming ◽  
Sequent Calculus ◽  
Logic Program ◽  
Logic Programs ◽  
Possible World ◽  
Property A ◽  
Rule Based ◽  
Negation As Failure ◽  
Constructive Proofs

What is the semantics of Negation-as-Failure in logic programming? We try to answer this question by proof-theoretic methods. A rule based sequent calculus is used in which a sequent is provable if, and only if, it is true in all three-valued models of the completion of a logic program. The main theorem is that proofs in the sequent calculus can be transformed into SLDNF-computations if, and only if, a program has the cut-property. A fragment of the sequent calculus leads to a sound and complete semantics for SLDNF-resolution with substitutions. It turns out that this version of SLDNF-resolution is sound and complete with respect to three-valued possible world models of the completion for arbitrary logic programs and arbitrary goals. Since we are dealing with possibly nonterminating computations and constructive proofs, three-valued possible world models seem to be an appropriate semantics.

Adding Prolog Rules and OOPs Inheritance to Legacy Databases

1991 ◽  
Author(s):  
Art Goldschmidt ◽  
Dipayan Gangopadhyay
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Object Oriented ◽  
Database System ◽  
Storage Management ◽  
Complex Objects ◽  
Rule Based ◽  
System Product ◽  
Viable Approach ◽  
Trigger Mechanisms

Abstract We present a viable approach to add rules capability or object orientation to legacy databases. Using a combination of language compilation, run-time trigger mechanisms and inter-language call facility, we integrate an object-oriented logic programming language, called OOLP, with an existing CIM Database System Product, IBM’s CIM CDF. The result is a system that provides storage management of complex objects, rule-based validation, object oriented knowledge modelling and declarative query capability.

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

Creating a Policy-Aware Web

2008 ◽  
pp. 81-100
Author(s):  
Daniel J. Weitzner ◽  
Jim Hendler ◽  
Tim Berners-Lee ◽  
Dan Connolly
Keyword(s):  
Semantic Web ◽  
Management System ◽  
World Wide ◽  
Theorem Prover ◽  
Future Research ◽  
Policy Management ◽  
Rule Based ◽  
The World ◽  
The Web ◽  
Current Mechanism

In this chapter, we describe the motivations for, and development of, a rule-based policy management system that can be deployed in the open and distributed milieu of the World Wide Web. We discuss the necessary features of such a system in creating a “Policy Aware” infrastructure for the Web and argue for the necessity of such infrastructure. We then show how the integration of a Semantic Web rules language (N3) with a theorem prover designed for the Web (Cwm) makes it possible to use the Hypertext Transport Protocol (http) to provide a scalable mechanismfor the exchange of rules and, eventually, proofs for access control on the Web. We also discuss which aspects of the Policy Aware Web are enabled by the current mechanism and describe future research needed to make the widespread deployment of rules and proofs on the Web a reality.

A Roadmap on Updates

2009 ◽  
pp. 2261-2267
Author(s):  
Fernando Zacarías Flores ◽  
Dionicio Zacarías Flores ◽  
Rosalba Cuapa Canto ◽  
Luis Miguel Guzmán Muñoz
Keyword(s):  
Standard Model ◽  
Logic Programming ◽  
Structural Properties ◽  
Relational Databases ◽  
Logic Program ◽  
Answer Set Programming ◽  
Central Issue ◽  
The Standard Model ◽  
Answer Set

Updates, is a central issue in relational databases and knowledge databases. In the last years, it has been well studied in the non-monotonic reasoning paradigm. Several semantics for logic program updates have been proposed (Brewka, Dix, & Knonolige 1997), (De Schreye, Hermenegildo, & Pereira, 1999) (Katsumo & Mendelzon, 1991). However, recently a set of proposals has been characterized to propose mechanisms of updates based on logic and logic programming. All these mechanisms are built on semantics based on structural properties (Eiter, Fink, Sabattini & Thompits, 2000) (Leite, 2002) (Banti, Alferes & Brogi, 2003) (Zacarias, 2005). Furthermore, all these semantic ones coincide in considering the AGM proposal as the standard model in the update theory, for their wealth in properties. The AGM approach, introduced in (Alchourron, Gardenfors & Makinson, 1985) is the dominating paradigm in the area, but in the context of monotonic logic. All these proposals analyze and reinterpret the AGM postulates under the Answer Set Programming (ASP) such as (Eiter, Fink, Sabattini & Thompits, 2000). However, the majority of the adapted AGM and update postulates are violated by update programs, as shown in(De Schreye, Hermenegildo, & Pereira, 1999).

Sign in / Sign up

Export Citation Format

Share Document