On the public citation graph
The Aurora or-parallel Prolog system
0 signed · 237 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16492-8_62openalex-snapshot
An abstract machine for restricted AND-parallel execution of logic programs
inferredcites →https://doi.org/10.1007/3-540-51285-3_38openalex-snapshot
Pruning and scheduling speculative work in or-parallel Prolog
inferredcites →https://doi.org/10.1007/bf02575007openalex-snapshot
Using automated reasoning tools: A study of the semigroupF 2 B 2
inferredcites →https://doi.org/10.1007/bfb0014984openalex-snapshot
Or-parallel execution models of Prolog
inferredcites →https://doi.org/10.1093/comjnl/30.5.386openalex-snapshot
Principles of the Delphi Parallel Inference Machine
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.405openalex-snapshot
Optimization schemas for parallel implementation of non‐deterministic languages and systems
inferred← citeshttps://doi.org/10.1002/spe.594openalex-snapshot
P#: a concurrent Prolog for the .NET framework
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1017openalex-snapshot
A Fine-Grained Parallel Memory Compaction Algorithm
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1629openalex-snapshot
Parallel Logic Programming Systems on Scalable Architectures
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_102openalex-snapshot
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_86openalex-snapshot
The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_14openalex-snapshot
A Novel Implementation of the Extended Andorra Model
inferred← citeshttps://doi.org/10.1007/3-540-45619-8_13openalex-snapshot
A Different Look at Garbage Collection for the WAM
inferred← citeshttps://doi.org/10.1007/3-540-48159-1_13openalex-snapshot
YapOr: An Or-Parallel Prolog System Based on Environment Copying
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_125openalex-snapshot
DAOS — Scalable And-Or Parallelism
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_211openalex-snapshot
Performance Evaluation of Or-Parallel Logic Programming Systems on Distributed Shared-Memory Architectures⋆
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_10openalex-snapshot
Or-Parallelism within Tabling
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_9openalex-snapshot
The Influence of Architectural Parameters on the Performance of Parallel Logic Programming Systems
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_38openalex-snapshot
Pruning and scheduling speculative work in or-parallel Prolog
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_39openalex-snapshot
Performance analysis of a Parallel Prolog: A correlated approach
inferred← citeshttps://doi.org/10.1007/3-540-52062-7_77openalex-snapshot
Exploring the epistemic labyrinth: New directions in the formal theory of knowledge representation
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_76openalex-snapshot
Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_77openalex-snapshot
Flexible scheduling of or-parallelism in Aurora: The Bristol scheduler
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_78openalex-snapshot
Virtual memory support for OR-parallel logic programming systems
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_79openalex-snapshot
Interfacing engines and schedulers in Or-Parallel Prolog systems
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_90openalex-snapshot
An architectural model for OR-parallellism on distributed memory systems
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_14openalex-snapshot
An efficient binding management in OR-parallel model
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_3openalex-snapshot
Controlling search with meta-Brave
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_4openalex-snapshot
Solving optimisation problems in the Aurora or-parallel Prolog system
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_6openalex-snapshot
A flexible scheduler for the Andorra-I system
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_8openalex-snapshot
Performance of Muse on the BBN Butterfly TC2000
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_9openalex-snapshot
Scheduling strategies and speculative work
inferred← citeshttps://doi.org/10.1007/3-540-55160-3_38openalex-snapshot
Parallel logic programming using the Linda model of computation
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_1openalex-snapshot
Potentiality of parallelism in logic
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_14openalex-snapshot
Or-parallel Prolog with heuristic task distribution
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_109openalex-snapshot
Message-brokers and communicating prolog processes
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_113openalex-snapshot
Performance of Muse on the BBN Butterfly TC2000
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_114openalex-snapshot
And-or parallelism in full Prolog with paged Binding Arrays
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_123openalex-snapshot
Reliable communication in VPL
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_126openalex-snapshot
Binding techniques and garbage collection for OR-parallel CLP systems
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_475openalex-snapshot
A time-bounded binding access with low task-switching cost in an OR-parallel prolog
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_23openalex-snapshot
Why and how in the ElipSys OR-parallel CLP system
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_82openalex-snapshot
A novel method for parallel implementation of findall
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_86openalex-snapshot
An OR parallel Prolog model for distributed memory systems
inferred← citeshttps://doi.org/10.1007/3-540-57287-2_46openalex-snapshot
An or-parallel prolog execution model for a distributed shared memory machine
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_58openalex-snapshot
A Linda-based runtime system for a distributed logic language
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_122openalex-snapshot
OR-parallel Prolog on distributed memory systems
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_5openalex-snapshot
Why Multi-SLD beats SLD (even on a uniprocessor)
inferred← citeshttps://doi.org/10.1007/3-540-58430-7_26openalex-snapshot
On logic program parallelisation strategies
inferred← citeshttps://doi.org/10.1007/3-540-58601-6_95openalex-snapshot
Some methodological issues in the design of CIAO, a generic, parallel concurrent constraint logic programming system
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_32openalex-snapshot
Improved branch and bound in constraint logic programming
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_41openalex-snapshot
Enhancing coordination and modularity mechanisms for a language with objects-as-multisets
inferred← citeshttps://doi.org/10.1007/3-540-61532-6_26openalex-snapshot
Parallel cost-based abductive reasoning for distributed memory systems
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_91openalex-snapshot
Multiple OR-parallel resolution: Meta-level control of parallel logic programs
inferred← citeshttps://doi.org/10.1007/978-1-4613-1537-7_9openalex-snapshot
The Cache Coherence Protocol of the Data Diffusion Machine
inferred← citeshttps://doi.org/10.1007/978-1-4613-1619-0_4openalex-snapshot
VLSI for Parallel Execution of Prolog
inferred← citeshttps://doi.org/10.1007/978-1-4615-2690-2_13openalex-snapshot
Divided We Stand: Parallel Distributed Stack Memory Management
inferred← citeshttps://doi.org/10.1007/978-1-4615-2690-2_14openalex-snapshot
Or-Parallel Prolog on Distributed Shared-Memory Architectures
inferred← citeshttps://doi.org/10.1007/978-1-4615-2690-2_2openalex-snapshot
I.C. Prolog II: a Multi-threaded Prolog System
inferred← citeshttps://doi.org/10.1007/978-1-4615-3604-8_17openalex-snapshot
A Dynamic Memory Management Scheme for Shared Memory Multiprocessors
inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_8openalex-snapshot
Parallelism in Logic Programming and Scheduling Issues
inferred← citeshttps://doi.org/10.1007/978-1-4899-1331-9_29openalex-snapshot
An Extended WAM Based Architecture for OR-Parallel Prolog Execution
inferred← citeshttps://doi.org/10.1007/978-3-540-24580-3_21openalex-snapshot
YapDss: An Or-Parallel Prolog System for Scalable Beowulf Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-77442-6_16openalex-snapshot
Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-78769-3_10openalex-snapshot
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_53openalex-snapshot
A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-92995-6_8openalex-snapshot
High Level Thread-Based Competitive Or-Parallelism in Logtalk
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_19openalex-snapshot
A Tabling Implementation Based on Variables with Multiple Bindings
inferred← citeshttps://doi.org/10.1007/978-3-642-17796-5_7openalex-snapshot
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-22531-4_8openalex-snapshot
Logic Java: Combining Object-Oriented and Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-27694-1_11openalex-snapshot
A Segment-Swapping Approach for Executing Trapped Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_10openalex-snapshot
The Family of Concurrent Logic Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-77281-8_25openalex-snapshot
Document Image Analysis Using Logic-Grammar-Based Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_50openalex-snapshot
Flexible Scheduling of Or-parallelism in Aurora: The Bristol Scheduler
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_52openalex-snapshot
Interfacing Engines and Schedulers in Or-Parallel Prolog Systems
inferred← citeshttps://doi.org/10.1007/978-94-011-2562-8_12openalex-snapshot
Reconciling Systems and Deductive Capabilities in Knowledge Based Systems Using Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_2openalex-snapshot
METEORs: High Performance Theorem Provers using Model Elimination
inferred← citeshttps://doi.org/10.1007/bf01018695openalex-snapshot
An application of an OR-Parallel Prolog system to phylogenetic analysis
inferred← citeshttps://doi.org/10.1007/bf01019947openalex-snapshot
Continuation-based control in the implementation of parallel logic programs
inferred← citeshttps://doi.org/10.1007/bf01113276openalex-snapshot
Performance visualization for parallel programs
inferred← citeshttps://doi.org/10.1007/bf01379187openalex-snapshot
Transforming generate-and-test programs to execute under committed-choice AND-parallelism
inferred← citeshttps://doi.org/10.1007/bf01379360openalex-snapshot
Parallel state-space search for a first solution with consistent linear speedups
inferred← citeshttps://doi.org/10.1007/bf01397626openalex-snapshot
Execution characteristics of layered streams
inferred← citeshttps://doi.org/10.1007/bf01397627openalex-snapshot
Full prolog and scheduling or-parallelism in muse
inferred← citeshttps://doi.org/10.1007/bf01407834openalex-snapshot
The muse approach to Or-parallel prolog
inferred← citeshttps://doi.org/10.1007/bf01408021openalex-snapshot
A distributed fair polling scheme applied to OR-parallel logic programming
inferred← citeshttps://doi.org/10.1007/bf01547894openalex-snapshot
Scheduling in or-parallel Prolog systems: Survey and open problems
inferred← citeshttps://doi.org/10.1007/bf02939540openalex-snapshot
Parallel execution of prolog on shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1007/bf02943584openalex-snapshot
Full or-parallemism and restricted And-parallelism in BTM
inferred← citeshttps://doi.org/10.1007/bf03037180openalex-snapshot
And-Or parallel Prolog: A recomputation based approach
inferred← citeshttps://doi.org/10.1007/bf03037202openalex-snapshot
A logic programming language based on the Andorra model
inferred← citeshttps://doi.org/10.1007/bf03037209openalex-snapshot
An abstract interpretation scheme for identifying inherent parallelism in logic programs
inferred← citeshttps://doi.org/10.1007/bf03037210openalex-snapshot
Compile-time granularity analysis for parallel logic programming languages
inferred← citeshttps://doi.org/10.1007/bf03037223openalex-snapshot
On the complexity of or-parallelism
inferred← citeshttps://doi.org/10.1007/bf03037345openalex-snapshot
Distributed programming with Logic Tuple Spaces
inferred← citeshttps://doi.org/10.1007/bf03037372openalex-snapshot
PAN: A portable, parallel Prolog: Its design, realisation and performance
inferred← citeshttps://doi.org/10.1007/bf03037472openalex-snapshot
Introduction of dosim predicate to Prolog
inferred← citeshttps://doi.org/10.1007/bf03037528openalex-snapshot
Performance of Muse on switch-based multiprocessor machines
inferred← citeshttps://doi.org/10.1007/bfb0002715openalex-snapshot
Automatic parallelization of irregular and pointer-based computations: Perspectives from logic and constraint programming
inferred← citeshttps://doi.org/10.1007/bfb0013541openalex-snapshot
Parallelizing Prolog on shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1007/bfb0017207openalex-snapshot
Garbage collection in Aurora: An overview
inferred← citeshttps://doi.org/10.1007/bfb0018384openalex-snapshot
A unified framework for characterising logic program executions
inferred← citeshttps://doi.org/10.1007/bfb0018385openalex-snapshot
An abstract machine for the Reduce-OR process model for parallel Prolog
inferred← citeshttps://doi.org/10.1007/bfb0018646openalex-snapshot
A priority control system for OR-parallel Prolog and its performance evaluation
inferred← citeshttps://doi.org/10.1007/bfb0020453openalex-snapshot
Relating data-parallelism and (and-) parallelism in logic programs
inferred← citeshttps://doi.org/10.1007/bfb0020454openalex-snapshot
On the duality between Or-parallelism and And-parallelism in logic programming
inferred← citeshttps://doi.org/10.1007/bfb0024152openalex-snapshot
Speculative computation in multilisp
inferred← citeshttps://doi.org/10.1007/bfb0024769openalex-snapshot
IDRA (ideal resource allocation): Computing ideal speedups in parallel logic programming
inferred← citeshttps://doi.org/10.1007/bfb0033850openalex-snapshot
Selective recomputation for handling side-effects in parallel logic programs
inferred← citeshttps://doi.org/10.1007/bfb0037156openalex-snapshot
A dynamic task distribution and engine allocation strategy for distributed execution of logic programs
inferred← citeshttps://doi.org/10.1007/bfb0056606openalex-snapshot
SICStus MT—A multithreaded execution environment for SICStus Prolog
inferred← citeshttps://doi.org/10.1007/bfb0057937openalex-snapshot
Optimising parallel logic programming systems for scalable machines
inferred← citeshttps://doi.org/10.1007/bfb0058027openalex-snapshot
On the complexity of parallel implementation of logic programs
inferred← citeshttps://doi.org/10.1007/s002360050002openalex-snapshot
How to calculate symmetries of Petri nets
inferred← citeshttps://doi.org/10.1007/s002360050094openalex-snapshot
Algebraic computational models of OR-parallel execution of Prolog
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00219-7openalex-snapshot
Logic programming and the execution model of Prolog
inferred← citeshttps://doi.org/10.1016/0096-0551(92)90013-dopenalex-snapshot
Parallel programming with logic languages: A survey
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90033-wopenalex-snapshot
Concurrency and backtracking in Vienna Parallel Logic
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90241-zopenalex-snapshot
Towards a parallel inference machine: the APIM project
inferred← citeshttps://doi.org/10.1016/0165-6074(91)90023-mopenalex-snapshot
A dataflow Prolog execution model and its architectural support
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90399-ropenalex-snapshot
An abstract prolog machine based on parallel resolution principle
inferred← citeshttps://doi.org/10.1016/0167-739x(91)90006-jopenalex-snapshot
DIALOG — A dataflow model for parallel execution of logic programs
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90072-jopenalex-snapshot
Structural operational semantics for AKL
inferred← citeshttps://doi.org/10.1016/0167-739x(93)90016-iopenalex-snapshot
Exploiting OR-parallelism in logic programs: A review
inferred← citeshttps://doi.org/10.1016/0167-739x(94)90052-3openalex-snapshot
Optimal implementation of and-or parallel Prolog
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90070-nopenalex-snapshot
A parallel Prolog resolution based on multiple unifications
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90168-fopenalex-snapshot
A Prolog technology theorem prover: a new exposition and implementation in Prolog
inferred← citeshttps://doi.org/10.1016/0743-1066(89)90012-5openalex-snapshot
Or-parallel PROLOG on shared memory multiprocessors
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90016-iopenalex-snapshot
Memory- and buffer-referencing characteristics of a WAM-based PROLOG
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90009-6openalex-snapshot
And—or parallelism on shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00092-5openalex-snapshot
Cuts and side-effects in and-or parallel Prolog
inferred← citeshttps://doi.org/10.1016/0952-1976(91)90029-6openalex-snapshot
Survey of hungarian KBS tools and applications in the engineering field
inferred← citeshttps://doi.org/10.1016/0956-0521(95)00042-9openalex-snapshot
Aurora vs. Muse: a portability study of two or-parallel Prolog systems
inferred← citeshttps://doi.org/10.1016/1069-0115(95)90038-1openalex-snapshot
Logic programming and the execution model of Prolog
inferred← citeshttps://doi.org/10.1016/b978-0-444-81704-4.50016-8openalex-snapshot
Massive Parallelism in Inference Systems
inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50016-6openalex-snapshot
A Model for Parallel Deduction
inferred← citeshttps://doi.org/10.1016/j.jmapro.2019.01.003openalex-snapshot
Nitinol manufacturing and micromachining: A review of processes and their suitability in processing medical-grade nitinol
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.05.002openalex-snapshot
Stack splitting: A technique for efficient exploitation of search parallelism on share-nothing platforms
inferred← citeshttps://doi.org/10.1016/j.parco.2004.09.001openalex-snapshot
The diffusion space of data diffusion architectures
inferred← citeshttps://doi.org/10.1016/s0096-0551(02)00004-8openalex-snapshot
An optimal data structure to handle dynamic environments in non-deterministic computations
inferred← citeshttps://doi.org/10.1016/s0096-0551(96)00010-0openalex-snapshot
Improving the efficiency of nondeterministic independent and-parallel systems
inferred← citeshttps://doi.org/10.1016/s0096-0551(96)00011-2openalex-snapshot
Relating data-parallelism and (and-) parallelism in logic programs
inferred← citeshttps://doi.org/10.1016/s0164-1212(98)10021-3openalex-snapshot
Exploiting and-or parallelism in Prolog: The OASys computational model and abstract architecture
inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00083-7openalex-snapshot
Handling side-effects and cuts with selective recomputation in parallel Prolog
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00051-xopenalex-snapshot
Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00088-7openalex-snapshot
Virtual memory on data diffusion architectures
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00082-8openalex-snapshot
Cuts and side-effects in distributed memory OR-parallel prolog
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00108-2openalex-snapshot
OASys: An AND/OR parallel logic programming system
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00014-3openalex-snapshot
Parallel execution of logic programs by load sharing
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00067-2openalex-snapshot
Multilog and data or-parallelism
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00079-9openalex-snapshot
Overview of DASWAM: Exploitation of dependent and-parallelism
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10022-5openalex-snapshot
Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00064-3openalex-snapshot
Or-parallel Prolog on a distributed memory architecture
inferred← citeshttps://doi.org/10.1017/s1471068404002030openalex-snapshot
On applying or-parallelism and tabling to logic programs
inferred← citeshttps://doi.org/10.1017/s1471068406002985openalex-snapshot
PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
inferred← citeshttps://doi.org/10.1017/s1471068411000172openalex-snapshot
Parallel backtracking with answer memoing for independent and-parallelism
inferred← citeshttps://doi.org/10.1017/s1471068411000482openalex-snapshot
SICStus Prolog—The first 25 years
inferred← citeshttps://doi.org/10.1017/s1471068422000059openalex-snapshot
Parallel Logic Programming: A Sequel
inferred← citeshttps://doi.org/10.1017/s1471068422000102openalex-snapshot
Fifty Years of Prolog and Beyond
inferred← citeshttps://doi.org/10.1023/a:1007529200051openalex-snapshot
Parallel Logic Programming for Problem Solving
inferred← citeshttps://doi.org/10.1023/a:1018929805694openalex-snapshot
Parallel symbolic computation in ACE
inferred← citeshttps://doi.org/10.1080/1206212x.2000.11441605openalex-snapshot
Parallel Evaluation of a Deductive Query with a Breadth-First Search Strategy
inferred← citeshttps://doi.org/10.1093/logcom/exu026openalex-snapshot
Coalgebraic logic programming: from Semantics to Implementation
inferred← citeshttps://doi.org/10.1109/12.312115openalex-snapshot
A highly OR-parallel inference machine (Multi-ASCA) and its performance evaluation: an architecture and its load balancing algorithms
inferred← citeshttps://doi.org/10.1109/52.31654openalex-snapshot
Comparing two parallel logic-programming architectures
inferred← citeshttps://doi.org/10.1109/71.265945openalex-snapshot
Machine independent AND and OR parallel execution of logic programs. II. Compiled execution
inferred← citeshttps://doi.org/10.1109/71.80190openalex-snapshot
Automatic generation of self-scheduling programs
inferred← citeshttps://doi.org/10.1109/71.80191openalex-snapshot
A parallel execution model of logic programs
inferred← citeshttps://doi.org/10.1109/71.969127openalex-snapshot
Backtracking in independent and-parallel implementations of logic programming languages
inferred← citeshttps://doi.org/10.1109/cicc.1992.591876openalex-snapshot
Proxima: Prolog Execution Machine
inferred← citeshttps://doi.org/10.1109/cmpsac.1991.170237openalex-snapshot
Development of the parallel inference machine RAP/LOP-WAM and its optimized parallel compiler
inferred← citeshttps://doi.org/10.1109/empdp.1993.336407openalex-snapshot
Load balanced parallel program verification on a shared memory machine
inferred← citeshttps://doi.org/10.1109/empdp.1993.336414openalex-snapshot
A Prolog interpreter for OR parallelism evaluation on distributed systems
inferred← citeshttps://doi.org/10.1109/hicss.1992.183173openalex-snapshot
Traffic patterns in a scalable multiprocessor through transputer emulation
inferred← citeshttps://doi.org/10.1109/hicss.1992.183287openalex-snapshot
Kaleidoscope visualization of fine-grain parallel programs
inferred← citeshttps://doi.org/10.1109/hicss.1993.284086openalex-snapshot
A systematic approach to exploiting implicit parallelism in Prolog
inferred← citeshttps://doi.org/10.1109/hicss.1996.495516openalex-snapshot
Distributing AND-work and OR-work in parallel logic programming systems
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679506openalex-snapshot
Granularity control for distributed execution of logic programs
inferred← citeshttps://doi.org/10.1109/icips.1997.669163openalex-snapshot
Parallel logic programming on distributed shared memory system
inferred← citeshttps://doi.org/10.1109/icips.1997.669198openalex-snapshot
Development of a new type of machining robot-a new type of driving mechanism
inferred← citeshttps://doi.org/10.1109/icpp.1999.797418openalex-snapshot
Efficient techniques for distributed implementation of search-based AI systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.199openalex-snapshot
Scheduling OR-parallelism in YapOr and ThOr on Multi-Core Machines
inferred← citeshttps://doi.org/10.1109/ipps.1993.262849openalex-snapshot
A parallel Prolog execution model: theoretical approach and experimental results
inferred← citeshttps://doi.org/10.1109/ipps.1994.288291openalex-snapshot
Parallel evaluation of a parallel architecture by means of calibrated emulation
inferred← citeshttps://doi.org/10.1109/ipps.1997.580937openalex-snapshot
Optimization schemas for parallel implementation of nondeterministic languages and systems
inferred← citeshttps://doi.org/10.1109/ipps.1999.760555openalex-snapshot
COWL: Copy-On-Write for logic programs
inferred← citeshttps://doi.org/10.1109/isca.1989.714521openalex-snapshot
Design And Performance Of A Coherent Cache For Parallel Logic Programming Architectures
inferred← citeshttps://doi.org/10.1109/spdp.1992.242731openalex-snapshot
The Dharma scheduler-definitive scheduling in Aurora on multiprocessors architecture
inferred← citeshttps://doi.org/10.1109/spdp.1992.242732openalex-snapshot
Complete and efficient methods for supporting side-effects and cuts in And-Or parallel Prolog
inferred← citeshttps://doi.org/10.1109/spdp.1996.570380openalex-snapshot
Last alternative optimization
inferred← citeshttps://doi.org/10.1145/151640.151345openalex-snapshot
Distributed last call optimization for portable parallel logic programming
inferred← citeshttps://doi.org/10.1145/152819.152822openalex-snapshot
And/Or parallel execution of logic programs
inferred← citeshttps://doi.org/10.1145/155183.155220openalex-snapshot
Analysis of Or-parallel execution models
inferred← citeshttps://doi.org/10.1145/181748.181753openalex-snapshot
A review of exploitation of AND-parallelism and combined AND/OR-parallelism in logic programs
inferred← citeshttps://doi.org/10.1145/2103736.2103738openalex-snapshot
Or-parallel prolog execution on multicores based on stack splitting
inferred← citeshttps://doi.org/10.1145/233561.233565openalex-snapshot
Compositional parallel programming languages
inferred← citeshttps://doi.org/10.1145/266670.266687openalex-snapshot
Evaluating parallel logic programming systems on scalable multiprocessors
inferred← citeshttps://doi.org/10.1145/266670.266691openalex-snapshot
Extended dynamic dependent and-parallelism in ACE
showing the first 200 of 232 · page through all 232
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.