chase-rs/README.md

139 lines
3.4 KiB
Markdown
Raw Normal View History

2026-03-09 09:59:10 +01:00
## Chase-rs
2026-03-06 10:52:32 +00:00
2026-03-09 09:59:10 +01:00
An implementation of the chase algorithm in Rust for advanced reasoning engines.
### Overview
The chase algorithm is a fundamental technique in context of database theory and knowledge representation used for:
- Query answering under tuple-generating dependencies (TGDs)
- Computing universal models
- Ontology-based data access (OBDA)
- Datalog with existential rules
2026-03-06 10:52:32 +00:00
2026-03-09 09:59:10 +01:00
This implementation provides a **restricted chase** that guarantees termination even with existential rules by tracking applied triggers.
2026-03-06 10:52:32 +00:00
### Features
2026-03-09 09:59:10 +01:00
- **Core Data Types**: Terms, Atoms, Rules, and Instances
- **Existential Quantification**: Automatic generation of labeled nulls
- **Restricted Chase**: Termination guarantees via trigger tracking
- **Fluent API**: `RuleBuilder` for readable rule construction
2026-03-10 12:41:33 +01:00
- **Interactive Frontends**: REPL, script runner, and a local GUI
2026-03-09 09:59:10 +01:00
- **Zero Dependencies**: Pure Rust with no external runtime dependencies
2026-03-06 10:52:32 +00:00
2026-03-09 09:59:10 +01:00
See [ROADMAP.md](ROADMAP.md) for the list of implemented and planned features.
2026-03-06 10:52:32 +00:00
2026-03-09 09:59:10 +01:00
> [!IMPORTANT]
> This project is still in early development, so bugs and breaking changes are expected.
> Please use the [issues page](https://code.obsidian.systems/habedi-work/chase-rs/issues) to report bugs or request features.
2026-03-06 10:52:32 +00:00
2026-03-09 09:59:10 +01:00
---
### Quickstart
#### Example
```rust
use chase_rs::{chase, Atom, Instance, Term};
use chase_rs::chase::rule::RuleBuilder;
// Create initial facts
let instance: Instance = vec![
Atom::new("Parent", vec![Term::constant("alice"), Term::constant("bob")]),
Atom::new("Parent", vec![Term::constant("bob"), Term::constant("carol")]),
].into_iter().collect();
// Define rules
// Parent(X, Y) -> Ancestor(X, Y)
let rule1 = RuleBuilder::new()
.when("Parent", vec![Term::var("X"), Term::var("Y")])
.then("Ancestor", vec![Term::var("X"), Term::var("Y")])
.build();
// Ancestor(X, Y), Parent(Y, Z) -> Ancestor(X, Z)
let rule2 = RuleBuilder::new()
.when("Ancestor", vec![Term::var("X"), Term::var("Y")])
.when("Parent", vec![Term::var("Y"), Term::var("Z")])
.then("Ancestor", vec![Term::var("X"), Term::var("Z")])
.build();
// Run the chase
let result = chase(instance, &[rule1, rule2]);
2026-03-06 10:52:32 +00:00
2026-03-09 09:59:10 +01:00
assert!(result.terminated);
println!("Derived {} facts", result.instance.len());
```
#### Existential Rules
Rules with head-only variables (existential quantification) automatically generate fresh labeled nulls:
```rust
// Every person has an SSN: Person(X) -> HasSSN(X, Y)
let rule = RuleBuilder::new()
.when("Person", vec![Term::var("X")])
.then("HasSSN", vec![Term::var("X"), Term::var("Y")]) // Y is existential
.build();
```
2026-03-10 12:41:33 +01:00
#### Frontends
The binary now supports three entrypoints:
```bash
# Start the interactive REPL
cargo run -- repl
# Start the local GUI at http://127.0.0.1:7878
cargo run -- gui
# Run a script file
2026-03-10 12:48:25 +01:00
cargo run -- script examples/scripts/ancestor.chase
2026-03-10 12:41:33 +01:00
```
The REPL and GUI share a minimal command language:
```text
fact Parent(alice, bob).
rule Parent(?X, ?Y) -> Ancestor(?X, ?Y).
run.
query Ancestor(?X, ?Y)?
show facts
show rules
reset
help
```
Rules:
- facts and rules end with `.`
- queries end with `?`
- variables are prefixed with `?`
- quoted constants are supported, for example `"alice smith"`
#### Useful Commands
2026-03-09 09:59:10 +01:00
```bash
2026-03-09 13:25:25 +01:00
# Install dependencies
nix develop -c make install-deps
2026-03-09 09:59:10 +01:00
# Run all tests
make test
# Run linter checks
make lint
# Run with optimizations
make build
# Run CLI
make run
```
---
### License
2026-03-06 10:52:32 +00:00
2026-03-09 09:59:10 +01:00
This project is licensed under [BSD-3](LICENSE).