Making prolog more expressive

Lloyd, John W.; Topor, Rodney W.

doi:10.1016/0743-1066(84)90011-6

Cited by 235 publications

(70 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We define size inst(O, R) = {size of ( the Lloyd-Topor transformations [9]. Part of the semantics of the RDF(S) vocabulary is represented as pre-defined rules (and not as semantic conditions on interpretations), which are grouped together in a module.…”

Section: Definition 13 (Modular Erdf Stable Model)mentioning

confidence: 99%

A Formal Theory for Modular ERDF Ontologies

Analyti

Antoniou

Damásio

2009

Web Reasoning and Rule Systems

View full text Add to dashboard Cite

Abstract. The success of the Semantic Web is impossible without any form of modularity, encapsulation, and access control. In an earlier paper, we extended RDF graphs with weak and strong negation, as well as derivation rules. The ERDF #n-stable model semantics of the extended RDF framework (ERDF) is defined, extending RDF(S) semantics. In this paper, we propose a framework for modular ERDF ontologies, called modular ERDF framework, which enables collaborative reasoning over a set of ERDF ontologies, while support for hidden knowledge is also provided. In particular, the modular ERDF stable model semantics of modular ERDF ontologies is defined, extending the ERDF #n-stable model semantics. Our proposed framework supports local semantics and different points of view, local closed-world and open-world assumptions, and scoped negation-as-failure. Several complexity results are provided.

show abstract

Section: Definition 13 (Modular Erdf Stable Model)mentioning

confidence: 99%

A Formal Theory for Modular ERDF Ontologies

Analyti

Antoniou

Damásio

2009

Web Reasoning and Rule Systems

View full text Add to dashboard Cite

show abstract

“…We deal with constraints in denial form: ← L 1 ∧ ... ∧ L m , with m≥1, where each L i is a literal and all variables are assumed to be universally quantified over the formula. More general constraints like foreign keys or functional dependencies can be transformed into this form by using [LlT84].…”

Section: Deductive Databasesmentioning

confidence: 99%

Consistency preserving updates in deductive databases

Mayol

Teniente

2003

Data & Knowledge Engineering

View full text Add to dashboard Cite

Several problems may arise when a deductive database is updated. The problems that are addressed in this paper are those of integrity constraint maintenance and view updating. In this sense, we define a method that tackles both problems in an integrated way and that it is sound and complete. We also propose an architecture for our method to deal with both problems efficiently. Improvement of efficiency during the integrity constraint maintenance is based on

show abstract

“…Second, the definition of program completion from (Clark 1978) has been extended to nondisjunctive programs with nested expressions (Lloyd and Topor 1984), and this extension is known to be equivalent to the definition of an answer set when-ever the program is "tight" (Erdem and Lifschitz 2003). In view of this fact, answer sets for a tight logic program can be generated by running a satisfiability solver on the program's completion (Babovich et al 2000).…”

Section: Introductionmentioning

confidence: 99%

Weight constraints as nested expressions

Ferraris¹,

Lifschitz²

2005

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

We compare two recent extensions of the answer set (stable model) semantics of logic programs. One of them, due to Lifschitz, Tang and Turner, allows the bodies and heads of rules to contain nested expressions. The other, due to Niemelä and Simons, uses weight constraints. We show that there is a simple, modular translation from the language of weight constraints into the language of nested expressions that preserves the program's answer sets. Nested expressions can be eliminated from the result of this translation in favor of additional atoms. The translation makes it possible to compute answer sets for some programs with weight constraints using satisfiability solvers, and to prove the strong equivalence of programs with weight constraints using the logic of here-and-there.

show abstract

Making prolog more expressive

Cited by 235 publications

References 2 publications

A Formal Theory for Modular ERDF Ontologies

A Formal Theory for Modular ERDF Ontologies

Consistency preserving updates in deductive databases

Weight constraints as nested expressions

Contact Info

Product

Resources

About