IJCAI 1989 - PDF Preprint Papers

IJCAI 1989

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IJCAI-1989 Paper

click to vote

IJCAI
1989

214views Artificial Intelligence» more IJCAI 1989»

Building a World Model for a Mobile Robot Using Dynamic Semantic Constraints

14 years 1 months ago

Download dli.iiit.ac.in

We are developing a new paradigm for a world model construction system which interprets a scene and builds a world model for a mobile robot using dynamic semantic constraints. The...

Minoru Asada, Yoshiaki Shirai

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	214	Building a World Model for a Mobile Robot Using Dynamic Semantic Constraints	claim
2	210	Focusing Attention for Observational Learning: The Importance of Context	claim
3	188	Constraint Posting for Verifying VLSI Circuits	claim
4	173	Integrating Knowledge-Based System and Neural Network Techniques for Robotic Skill Acquisition	claim
5	156	A Maneuvering-Board Approach to Path Planning with Moving Obstacles	claim
6	155	A Problem Space Approach to Expert System Specification	claim
7	152	A Theorem Prover for Prioritized Circumscription	claim
8	151	Beyond PDP: The Frequency Modulation Neural Network Architecture	claim
9	148	Constraint Satisfaction with Delayed Evaluation	claim
10	146	An Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification Methods	claim
11	144	Noise-Tolerant Instance-Based Learning Algorithms	claim
12	143	Bidirectional Use of Knowledge in the Multi-modal NL Access System XTRA	claim
13	140	Input Data Management in Real-Time AI Systems	claim
14	137	An Adaptive Model of Decision-Making in Planning	claim
15	136	Generating Better Decision Trees	claim
16	134	Chromatic Stereopsis	claim
17	134	A Homogeneous Framework for Visual Recognition	claim
18	133	Measure-Free Conditioning, Probability and Non-Monotonic Reasoning	claim
19	131	Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains	claim
20	130	Introducing Actions into Qualitative Simulation	claim
21	129	Coping With Uncertainty in Map Learning	claim
22	129	Logic Programming with General Clauses and Defaults Based on Model Elimination	claim
23	129	Execution Architectures and Compilation	claim
24	127	Minimal Change and Maximal Coherence: A Basis for Belief Revision and Reasoning about Actions	claim
25	127	Preprocessing Search Spaces for Branch and Bound Search	claim
26	126	Can Early Stage Vision Detect Topology	claim
27	126	Motion Planning of Multi-Joint Robotic Arm with Topological Dimension Reduction Method	claim
28	125	Functional Representation of Designs and Redesign Problem Solving	claim
29	125	An Approximate Solver for Symbolic Equations	claim
30	124	An Algebraic Approach to Constraint Satisfaction Problems	claim
31	123	Reasoning about Kinematic Topology	claim
32	122	Reasoning About Assumptions in Graphs of Models	claim
33	122	Constrained Heuristic Search	claim
34	122	Layering Predictions: Flexible Use of Dialog Expectation in Speech Recognition	claim
35	121	A Parallel Parser for Spoken Natural Language	claim
36	121	Decision-Making in an Embedded Reasoning System	claim
37	121	Visual Reasoning in Geometry Theorem Proving	claim
38	121	Prediction is Deduction but Explanation is Abduction	claim
39	120	Induction in an Abstraction Space: A Form of Constructive Induction	claim
40	120	Controlling a Language Generation Planner	claim
41	120	Building Robust Learning Systems by Combining Induction and Optimization	claim
42	120	Neural Computing on a One Dimensional SIMD Array	claim
43	119	A Critique of the Valiant Model	claim
44	119	An Experimental Comparison of Symbolic and Connectionist Learning Algorithms	claim
45	118	Approximation of Indistinct Concepts	claim
46	117	Real-Time AI Systems: A Definition and An Architecture	claim
47	117	Using Line Correspondence Stereo to Measure Surface Orientation	claim
48	116	Perturbation Analysis with Qualitative Models	claim
49	115	The Logic of Time Structures: Temporal and Nonmonotonic Features	claim
50	115	Approximation Algorithms for Temporal Reasoning	claim
51	114	A Framework for Network Modeling in Prolog	claim
52	113	A Focused, Context-Sensitive Approach to Monitoring	claim
53	113	Detecting and Correcting Errors of Omission After Explanation-Based Learning	claim
54	113	Formal Properties and Implementation of Bidirectional Charts	claim
55	112	On the Declarative Semantics of Inheritance Networks	claim
56	111	A Technique for Customizing Object-Oriented Knowledge Representation Systems, With An Application to Network Problem Management	claim
57	111	Experiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor	claim
58	111	Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds	claim
59	111	Acquiring Recursive Concepts with Explanation-Based Learning	claim
60	111	Towards a General Framework for Composing Disjunctive and Iterative Macro-operators	claim
61	111	A Probabilistic Approach to Marker Propagation	claim
62	110	Preferred Subtheories: An Extended Logical Framework for Default Reasoning	claim
63	110	Goal Ordering in Partially Ordered Plans	claim
64	110	A Model for Projection and Action	claim
65	110	Training Feedforward Neural Networks Using Genetic Algorithms	claim
66	109	Three-Dimensional Interpretation of Quadrilaterals	claim
67	108	Constraint Satisfiability Algorithms for Interactive Student Scheduling	claim
68	108	An Integrated Knowledge Based Assembly Control System for Automobile Manufacturing	claim
69	108	Chart Parsing of Flowgraphs	claim
70	107	Alternatives for Classifier System Credit Assignment	claim
71	107	Simulating Student Programmers	claim
72	106	Comparing the Conceptual Systems of Experts	claim
73	106	Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm	claim
74	106	Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory	claim
75	106	Improving Efficiency by Learning Intermediate Concepts	claim
76	105	A Computational Framework for Granularity and its Application to Educational Diagnosis	claim
77	105	Normality and Faults in Logic-Based Diagnosis	claim
78	104	Automating the Construction of Patchers That Satisfy Global Constraints	claim
79	103	Stochastic Analysis of Qualitative Dynamics	claim
80	103	A Planning/Scheduling Methodology for the Constrained Resource Problem	claim
81	103	Learning Novel Domains Through Curiosity and Conjecture	claim
82	102	Computing Pronoun Antecedents in an English Query System	claim
83	102	A Diagnostic Algorithm based on Models at Different Level of Abstraction	claim
84	102	Concept Formation by Incremental Conceptual Clustering	claim
85	102	Diagnosis with Behavioral Modes	claim
86	102	Call-Graph Caching: Transforming Programs into Networks	claim
87	101	Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains	claim
88	101	Conspiracy Numbers and Caching for Searching And/Or Trees and Theorem-Proving	claim
89	101	Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans	claim
90	101	A Correct Non-Monotonic ATMS	claim
91	100	A Modest, but Semantically Well Founded, Inheritance Reasoner	claim
92	100	Reducing the Derivation of Redundant Clauses in Reasoning Systems	claim
93	100	Rapid Retrieval Algorithms for Case-Based Reasoning	claim
94	99	Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems	claim
95	99	A Knowledge-Based Software Information System	claim
96	99	The Specialization and Transformation of Constructive Existence Proofs	claim
97	99	Chemical Analogies: Two Kinds of Explanation	claim
98	98	And-Or Graphs Applied to RUE Resolution	claim
99	98	On the Semantics of Counterfactuals	claim
100	98	Learning to Diagnose by Doing	claim
101	98	Control of Refitting during Plan Reuse	claim
102	97	On Optimal Game-Tree Search using Rational Meta-Reasoning	claim
103	96	Recognizing Unnecessary Inference	claim
104	96	A Study of Empirical Learning for an Involved Problem	claim
105	95	Program Derivation Using Analogy	claim
106	95	Temporal Matching: Recognizing Dynamic Situations from Discrete Measurements	claim
107	94	Negative Reasoning Using Inheritance	claim
108	94	Selective Learning of Macro-operators with Perfect Causality	claim
109	93	Ordering Problem Subgoals	claim
110	93	The Search Ahead Conflict Resolution for Parallel Firing of Production Systems	claim
111	93	The Reason for the Benefits of Minimax Search	claim
112	92	Simplification and Abstraction of Kinematic Behaviors	claim
113	92	Maximum Entropy in Nilsson's Probabilistic Logic	claim
114	92	Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge	claim
115	92	Semantic Interpretation Based on the Multi-World Model	claim
116	91	Generating Causal Explanation from a Cardio-Vascular Simulation	claim
117	91	A Sequential View of AND-Parallelism Through Partial AND-Processes	claim
118	90	Plausible Inferencing Using Extended Composition	claim
119	90	Experience Learning in Model-Based Diagnostic Systems	claim
120	89	Generation, Local Receptive Fields and Global Convergence Improve Perceptual Learning in Connectionist Networks	claim
121	88	Neuroplanners and Their Application to Eyes/Head/Neck Coordination	claim
122	88	Platypus: A Constraint-Based Reasoning System	claim
123	88	Generalized Game Trees	claim
124	88	Time for Action: On the Relation Between Time, Knowledge and Action	claim
125	88	On Wu's Method for Proving Constructive Geometric Theorems	claim
126	87	Domain Dependence in Parallel Constraint Satisfaction	claim
127	87	Extending Reflective Architectures	claim
128	87	The Correction Machine: Formulating Explanations for User Misconceptions	claim
129	87	Reconstructive Explanation: Explanation as Complex Problem Solving	claim
130	86	Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking	claim
131	86	Managing Efficiently Temporal Relations Through Indexed Spanning Trees	claim
132	86	Semantics of Perspectival Utterances	claim
133	86	A Comparison of ATMS and CSP Techniques	claim
134	86	Learning DNF by Decision Trees	claim
135	86	Learning Subgoal Sequences for Planning	claim
136	85	Generating Facts From Opinions with Information Source Models	claim
137	84	Solving Time-Dependent Planning Problems	claim
138	84	Minimizing Response Times in Real Time Planning and Search	claim
139	83	Sometimes Updates Are Circumscription	claim
140	82	Node Aggregation for Distributed Inference in Bayesian Networks	claim
141	82	On the Relation Between Truth Maintenance and Autoepistemic Logic	claim
142	82	A Computational Structure for the Propositional Calculus	claim
143	81	Incorporating Redundant Learned Rules: A Preliminary Formal Analysis of EBL	claim
144	81	Eliminating Expensive Chunks by Restricting Expressiveness	claim
145	81	On Cooperation in a Multi-Entity Model	claim
146	80	Skeptical Inheritance: Computing the Intersection of Credulous Extensions	claim
147	79	Using Generic Knowledge in Analysis of Aerial Scenes: A Case Study	claim
148	79	Explaining Prolog Based Expert Systems Using a Layered Meta-Interpreter	claim
149	78	A Theory of Diagnosis for Incomplete Causal Models	claim
150	78	Towards Finding Optimal Solutions with Non-Admissible Heuristics: A New Technique	claim
151	78	A New Metaphor for the Graphical Explanation of Forward-Chaining Rule Execution	claim
152	78	Correct Parallel Status Assignment for the Reason Maintenance System	claim
153	77	A Case-Based Mechanical Redesign System	claim
154	77	An Empirical Comparison of ID3 and Back-propagation	claim
155	77	Multi-Dimensional Heuristic Searching	claim
156	75	Explanation Based Program Transformation	claim
157	75	Objective Functions for Feature Discrimination	claim
158	75	A Vectorization Technique for Prolog without Explosion	claim
159	74	Candidate Ordering and Elimination in Model-Based Fault Diagnosis	claim
160	74	Focus of Control Through Goal Relationships	claim
161	73	A Symbol Is Not a Symbol	claim
162	71	Reasoning About Hidden Mechanisms	claim
163	70	Searching Game Trees in Parallel Using SSS	claim
164	69	Noise-Tolerant Conceptual Clustering	claim
165	68	Using a Feature Algebra for Reasoning about Geometric Feature Interactions	claim
166	67	Vivid Knowledge and Tractable Reasoning	claim
167	67	A Reactive Approach to Explanation	claim
168	66	Reference Frames for Animate Vision	claim
169	66	Temporally Coarse Representation of Behavior for Model-based Troubleshooting of Digital Circuits	claim
170	64	Single-Agent Parallel Window Search: A Summary of Results	claim
171	63	Model-Based Monitoring of Dynamic Systems	claim
172	62	Phrasing a Text in Terms the User Can Understand	claim
173	62	A Semantical Approach to Stable Inheritance Reasoning	claim
174	59	A Model of Planning for Plan Efficiency: Taking Advantage of Operator Overlap	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers