Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

Lecture Notes in Computer Science - Germany
doi 10.1007/11799573_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

On Proving Syntactic Properties of CPS Programs

BRICS Report Series
1999English

Proving Acceptability Properties of Relaxed Nondeterministic Approximate Programs

ACM SIGPLAN Notices
Computer Science
2012English

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

A Compositional Logic for Proving Security Properties of Protocols*

Journal of Computer Security
RiskComputer NetworksHardwareCommunicationsReliabilitySafetyArchitectureQualitySoftware
2003English

Automated Theorem Proving by Translation to Description Logic

EasyChair Preprints
2018English

Complexity of Existential Positive First-Order Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy