Deterministic nouns
Noun phrases always start with determiners or quantifiers, while bare identifiers are names.
CNL-PL is a controlled natural language that looks like English but maps to a unique logical AST. It powers queries, proofs, planning, constraint solving, simulation, and explanation.
"Users who are admins or developers and active"
Does "active" apply to admins too? Or just developers?"A user who is an admin or who is a developer, and who is active"
Explicit grouping and pronoun repetition remove all ambiguity.A simple CNL program that defines a rule and asks a question.
// Define a rule If a user is an admin, then the user has access to the database. // Define a fact John is a user and John is an admin. // Execute a query Verify that John has access to the database.
The same CNL sentence can drive different engines. Pragmatics define the operational meaning without changing the surface grammar.
Ask structured questions and get grounded answers with selector expressions.
ProofCheck whether a statement is derivable and return a proof path in CNL.
PlanDescribe tools and constraints, then generate ordered plans to reach goals.
SolveFind assignments for variables that satisfy all constraints.
OptimizeSearch for optimal solutions based on attribute objectives.
SimulateApply transition rules to evolve a state machine for N steps.
ExplainAsk why a fact holds and trace the supporting rules.
Noun phrases always start with determiners or quantifiers, while bare identifiers are names.
Mixed boolean operators require explicit grouping. The parser rejects ambiguous chains.
Assertions use subject-verb-object or controlled copula predicates as the core unit.
Plans model action signatures, agents, preconditions, and effects as structured blocks.
Jump directly into the working sets that drive the project.