A truth maintenance system

Artificial Intelligence

Volumn 12, Issue 3, 1979, Pages 231-272

  Doyle, Jon ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

EID: 0018544688     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(79)90008-0     Document Type: Article

References (65)

1. List processing in real time on a serial computer
2. How a computer should think
3. On knowing what to say: Planning speech acts
4. Simulations of belief systems
5. Deduction plans: A graphical proof procedure for the first-order predicate calculus
6. State deltas: A formalism for representing segments of computation
7. Local methods for localization of failures in electronic circuits
8. Causal and teleological reasoning in circuit recognition
9. Explicit control of reasoning
10. Propagation of constraints applied to circuit synthesis
11. How to change your mind
12. The use of dependency relationships in the control of reasoning
13. Truth maintenance systems for problem solving
14. Reflexive interpreters
15. Deductive retrieval mechanisms for state description models
16. Plausible inference: A multi-valued logic for problem solving
17. The problem of counterfactual conditionals
18. The frame problem and related problems in artificial intelligence
19. A representation for robot plans
20. Logical analysis of programs
21. A note on deduction rules with negative premises
22. Une application de l'intelligence artificielle a la conception assistée par ordinateur (tropic)
23. Failure processing in a system for designing complex assemblies
24. Dependency networks as a representation for modelling in general problem solvers
25. A three-valued truth maintenance system
26. The use of equality in deduction and knowledge representation
27. Assimilation of new information by a natural language understanding system
28. Very large planner-type data bases
29. Planning and acting
30. Non-monotonic logic I
31. A framework for representing knowledge
32. K-lines: A theory of memory
33. Reasoning about knowledge and action
34. A system for incrementally designing and verifying programs
35. A human-oriented logic for automatic theorem proving
36. Two dogmas of empiricism
37. On reasoning by default
38. Computer aided evolutionary design for software engineering
39. Plan recognition using a hypothesize and revise paradigm: An example
40. Truisms as the grounds for historical explanations
41. Dependency directed reasoning for complex program understanding
42. Representation of actions that have side-effects
43. The architecture of coherent information system A general problem solving system
44. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
45. Integrating truth maintenance systems with propagation of strength of belief as a means of addressing the fusion problem
46. Structural complexity of proofs
47. Constraints
48. A survey of contemporary learning theories
49. From planner to conniver—A genetic approach
50. Heuristic techniques in computer-aided circuit analysis
51. Network truth maintenance for deduction and modelling
52. The structure of natural explanations: Theory and applications
53. Prolegomena to a theory of formal reasoning
54. Fuzzy logic and approximate reasoning