Investigating production system representations for non-combinatorial match

DOI10.1016/0004-3702(94)90097-3zbMath0942.68725OpenAlexW2112386567MaRDI QIDQ1330671

Milind Tambe, Paul S. Rosenbloom

Publication date: 14 August 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90097-3

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (2)

The anatomy of vampire. Implementing bottom-up procedures with code trees ⋮ Bounding the cost of learned rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering conjunctive queries
• Network-based heuristics for constraint-satisfaction problems
• Consistency in networks of relations
• The structure and variability of dynamo driven accretion discs

This page was built for publication: Investigating production system representations for non-combinatorial match