Investigating production system representations for non-combinatorial match

DOI10.1016/0004-3702(94)90097-3MaRDI QIDQ1330671zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Consistency in networks of relations
• scientific article; zbMATH DE number 4162231 (Why is no real title available?)
• scientific article; zbMATH DE number 4166908 (Why is no real title available?)
• scientific article; zbMATH DE number 3688764 (Why is no real title available?)
• scientific article; zbMATH DE number 43232 (Why is no real title available?)
• scientific article; zbMATH DE number 43236 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Network-based heuristics for constraint-satisfaction problems
• Ordering conjunctive queries
• The structure and variability of dynamo driven accretion discs

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330671)