Write in a clean editor, then format for Theory and Practice of Logic Programming in one click — DocuGuru applies the official Cambridge University Press template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Theory and Practice of Logic Programming is a peer-reviewed journal published by Cambridge University Press, covering Logic, Reasoning, and Knowledge, Logic, programming, and type systems, Multi-Agent Systems and Negotiation.
| Publisher | Cambridge University Press |
|---|---|
| Reference style | Numbered Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, Theory and Practice of Logic Programming 12 (2023) 45–58.
Formats any DOI in the closest standard style — Theory and Practice of Logic Programming has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Logic, Reasoning, and Knowledge Logic, programming, and type systems Multi-Agent Systems and Negotiation Semantic Web and Ontologies Formal Methods in Verification |
| ISSN | 1471-0684 |
| Citation impact (2-yr) | 0.86 |
| h-index | 53 |
| i10-index | 337 |
| Total citations | 14,619 |
| Top institutions publishing here | University of Calabria |
| Journal website | journals.cambridge.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation inference mechanism for warranting the entailed conclusions. In DeLP an argumentation formalism will be…
Abstract SWI-Prolog is neither a commercial Prolog system nor a purely academic enterprise, but increasingly a community project. The core system has been shaped to its current form while being used as a tool for building research prototypes, primarily for knowledge-intensive and interactive systems. Community contributions have added several interfaces and the constraint (CLP) libraries.…
Abstract This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while causal Bayes nets serve as a probabilistic foundation. We give several non-trivial examples and illustrate the use of P-log for knowledge representation and updating of knowledge. We argue…
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the constraints. In this paper we apply logic programming based on answer sets to the problem of retrieving consistent information from a possibly inconsistent database.…
Abstract The Semantic Web drives toward the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the Semantic Web provides a unifying representation of richly structured data. Adding logic to the Web implies the use of rules to make inferences, choose courses of action, and…
