Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
The family of concurrent logic programming languages
E Shapiro - ACM Computing Surveys (CSUR), 1989 - dl.acm.org
Concurrent logic languages are high-level programming languages for parallel and
distributed systems that offer a wide range of both known and novel concurrent …
distributed systems that offer a wide range of both known and novel concurrent …
An access control model supporting periodicity constraints and temporal reasoning
Access control models, such as the ones supported by commercial DBMSs, are not yet able
to fully meet many application needs. An important requirement derives from the temporal …
to fully meet many application needs. An important requirement derives from the temporal …
Negation in rule-based database languages: a survey
N Bidoit - Theoretical computer science, 1991 - Elsevier
This paper surveys and compares different techniques investigated in order to integrate
negation in rule-based query languages. In the context of deductive databases, a rule-based …
negation in rule-based query languages. In the context of deductive databases, a rule-based …
Algebraic properties of idempotent substitutions
C Palamidessi - International Colloquium on Automata, Languages …, 1990 - Springer
This paper presents an algebra of idempotent substitutions whose operations have many
properties. We provide an algorithm to compute these operations and we show how they are …
properties. We provide an algorithm to compute these operations and we show how they are …
A general framework for semantics-based bottom-up abstract interpretation of logic programs
R Barbuti, R Giacobazzi, G Levi - ACM Transactions on Programming …, 1993 - dl.acm.org
The theory of abstract interpretation provides a formal framework to develop advanced
dataflow analysis tools. The idea is to define a nonstandard semantics which is able to …
dataflow analysis tools. The idea is to define a nonstandard semantics which is able to …
Meta-reasoning: A survey
S Costantini - Computational Logic: Logic Programming and Beyond …, 2002 - Springer
We present the basic principles and possible applications of systems capable of meta-
reasoning and reflection. After a discussion of the seminal approaches, we outline our own …
reasoning and reflection. After a discussion of the seminal approaches, we outline our own …
A compositional semantics for logic programs
This paper considers open logic programs originally as a tool to build an OR-compositional
semantics of logic programs. We extend the original semantic definitions in the framework of …
semantics of logic programs. We extend the original semantic definitions in the framework of …
A bottom-up polymorphic type inference in logic programming
R Barbuti, R Giacobazzi - Science of computer programming, 1992 - Elsevier
We present a type inference system for Horn clause logic programs, based on a bottom-up
abstract interpretation technique. Through the definition of suitable abstract operators, we …
abstract interpretation technique. Through the definition of suitable abstract operators, we …
Basic transformation operations which preserve computed answer substitutions of logic programs
A Bossi, N Cocco - The Journal of Logic Programming, 1993 - Elsevier
Some transformation operations for logic programs, basic for partial deduction, program
specialization, and transformation, and for program synthesis from specifications, are …
specialization, and transformation, and for program synthesis from specifications, are …
Déja vu in fixpoints of logic programs
MJ Maher, R Ramakrishnan - 1989 - minds.wisconsin.edu
We investigate properties of logic programs that permit refinements in their fixpoint
evaluation and shed light on the choice of control strategy. A fundamental aspect of a bottom …
evaluation and shed light on the choice of control strategy. A fundamental aspect of a bottom …