GHC

swMATH23765MaRDI QIDQ35532FDOQ35532

Author name not available (Why is that?)

Official website: https://link.springer.com/chapter/10.1007%2F3-540-16479-0_17

Cited In (61)

• VeriFly
• The semantics of the combination of atomized statements and parallel choice
• Contributions to the semantics of logic perpetual processes
• An execution model for exploiting AND-parallelism in logic programs
• Flat Parlog: A basis for comparison
• Semantic models for concurrent logic languages
• An abstract machine for the implementation of PARLOG on uniprocessors
• Unfolding rules for GHC programs
• Bounded quantifications for iteration and concurrency in logic programming
• A parallel parsing system for natural language analysis
• An algebraic semantics for structured transition systems and its application to logic programs
• Constraint-based concurrency and beyond
• Title not available (Why is that?)
• Title not available (Why is that?)
• An integrated framework for the diagnosis and correction of rule-based programs
• Real number computation with committed choice logic programming languages
• TCC, with history
• MLOG: A strongly typed confluent functional language with logical variables
• DASWAM
• clpfd
• CDAOstore
• wamcc
• LMNtal
• Title not available (Why is that?)
• PhyloWS
• Kima
• Kernel-LEAF
• Janus
• Multilisp
• TeaBag
• WebPIE
• OPTYap
• YapOr
• Locally parallel cache design based on KL1 memory access characteristics
• PARLOG
• April
• LPaaS
• HaLoop
• tccp
• Yedalog
• DiSCiPl
• SWISH DataLab
• 2P-Kt
• tuProlog
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Models and emerging trends of concurrent constraint programming
• A canonical form for generalized linear constraints
• Transforming generate-and-test programs to execute under committed-choice AND-parallelism
• Kima: An automated error correction system for concurrent logic programs
• Making exhaustive search programs deterministic
• A declarative semantics of flat guarded Horn clauses for programs with perpetual processes
• Finite failures and partial computations in concurrent logic languages
• The implementation of a distributed model for logic programming based on multiple-headed clauses
• Compiling OR-parallelism into AND-parallelism
• P-Prolog: A parallel logic language based on exclusive relation
• Title not available (Why is that?)
• Title not available (Why is that?)
• CUD@SAT
• Specification and initialization of a logic computer system
• Comparative metric semantics for concurrent PROLOG
• Control and data driven execution of logic programs: A comparison

This page was built for software: GHC