Prolog: The Standard

Deransart, Pierre; Ed-Dbali, AbdelAli; Cervoni, Laurent

doi:10.1007/978-3-642-61411-8

Cited by 73 publications

(45 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We show that this new transformation has significant practical advantages in Sect. 6 and, finally, conclude in Sect. 7.…”

Section: Introductionmentioning

confidence: 88%

“…1 recapitulates the formulation of the operational semantics of logic programming with cut that we introduced in [18]. A formal proof on the correspondence of our inference rules to the semantics of the Prolog ISO standard [6] can be found in [20]. The formulation with our inference rules is particularly suitable for an extension to classes of queries in Fig.…”

Section: Examplementioning

confidence: 99%

“…Let D be a set of DTs, P be the program under consideration, and Q be the class of queries to be analyzed. 6 A (possibly infinite) sequence (H 0 ← I 0 , B 0 ), (H 1 ← I 1 , B 1 ), . .…”

Section: Transformation Into Dependency Triple Problemsmentioning

confidence: 99%

See 2 more Smart Citations

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

Ströder

Schneider–Kamp

Giesl

2011

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. In very recent work, we introduced a non-termination preserving transformation from logic programs with cut to definite logic programs. While that approach allows us to prove termination of a large class of logic programs with cut automatically, in several cases the transformation results in a non-terminating definite logic program. In this paper we extend the transformation such that logic programs with cut are no longer transformed into definite logic programs, but into dependency triple problems. By the implementation of our new method and extensive experiments, we empirically evaluate the practical benefit of our contributions.

show abstract

“…We show that this new transformation has significant practical advantages in Sect. 6 and, finally, conclude in Sect. 7.…”

Section: Introductionmentioning

confidence: 88%

Section: Examplementioning

confidence: 99%

See 1 more Smart Citation

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

Ströder

Schneider–Kamp

Giesl

2011

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…SOUL is a variant of Prolog [6] with some minor syntactic differences. Below we give an example of the syntax.…”

Section: A Syntaxmentioning

confidence: 99%

Identifying refactoring opportunities using logic meta programming

Tourwé

Mens

Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.

103

View full text Add to dashboard Cite

Abstract-In this paper, we show how automated support can be provided for identifying refactoring opportunities, e.g., when an application's design should be refactored and which refactoring(s) in particular should be applied. Such support is achieved by using the technique of logic meta programming to detect so-called bad smells and by defining a framework that uses this information to propose adequate refactorings. We report on some initial but promising experiments that were applied using the proposed techniques.

show abstract

“…Then, we briefly describe how the query language can be implemented in a logic programming as queries to a definite logic program. Existing systems like Prolog [24], XSB [25], or SModels [26,27] can then be used to compute the answers. We assume that the reader is familiar with the basics of logic programming [28].…”

Section: A Query Language and Its Implementationmentioning

confidence: 99%

A Four-Valued Logic for Rough Set-Like Approximate Reasoning

Maluszynski

Szałas

Vitória

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper extends the basic rough set formalism introduced by Pawlak [1] to a rule-based knowledge representation language, called Rough Datalog, where rough sets are represented by predicates and described by finite sets of rules. The rules allow us to express background knowledge involving rough concepts and to reason in such a knowledge base. The semantics of the new language is based on a four-valued logic, where in addition to the usual values TRUE and FALSE, we also have the values BOUNDARY, representing uncertainty, and UNKNOWN corresponding to the lack of information. The semantics of our language is based on a truth ordering different from the one used in the well-known Belnap logic [2, 3] and we show why Belnap logic does not properly reflect natural intuitions related to our approach. The declarative semantics and operational semantics of the language are described. Finally, the paper outlines a query language for reasoning about rough concepts.

show abstract

Prolog: The Standard

Cited by 73 publications

References 0 publications

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

Identifying refactoring opportunities using logic meta programming

A Four-Valued Logic for Rough Set-Like Approximate Reasoning

Contact Info

Product

Resources

About