scientific article
From MaRDI portal
Publication:3994465
zbMath0771.68037MaRDI QIDQ3994465
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Specification and initialization of a logic computer system ⋮ Control and data driven execution of logic programs: A comparison ⋮ Making exhaustive search programs deterministic ⋮ An execution model for exploiting AND-parallelism in logic programs ⋮ Flat Parlog: A basis for comparison ⋮ Unfolding rules for GHC programs ⋮ Contributions to the semantics of logic perpetual processes ⋮ An abstract machine for the implementation of PARLOG on uniprocessors ⋮ Transforming generate-and-test programs to execute under committed-choice AND-parallelism ⋮ Comparative metric semantics for concurrent PROLOG ⋮ Finite failures and partial computations in concurrent logic languages ⋮ A declarative semantics of flat guarded Horn clauses for programs with perpetual processes ⋮ Semantic models for concurrent logic languages ⋮ A canonical form for generalized linear constraints ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ Real number computation with committed choice logic programming languages ⋮ A parallel parsing system for natural language analysis ⋮ GHC ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ P-Prolog: A parallel logic language based on exclusive relation ⋮ Compiling OR-parallelism into AND-parallelism ⋮ MLOG: A strongly typed confluent functional language with logical variables