AAAI 1996 - PDF Preprint Papers

AAAI 1996

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed AAAI-1996 Paper

click to vote

AAAI
1996

343views Intelligent Agents» more AAAI 1996»

Social Laws For Agent Modeling

14 years 23 days ago

Download www.aaai.org

Social Laws for Agent Modeling Dept. Multiagent domains emphasize that agents

Amol Dattatraya Mali

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	343	Social Laws For Agent Modeling	claim
2	197	Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations	claim
3	191	Evolution-Based Discovery of Hierarchical Behaviors	claim
4	185	Improved Limited Discrepancy Search	claim
5	185	Bagging, Boosting, and C4.5	claim
6	185	Closed Terminologies in Description Logics	claim
7	183	On Competence and Meta-Knowledge	claim
8	182	Scaling Up Explanation Generation: Large-Scale Knowledge Bases and Empirical Studies	claim
9	177	Building Steady-State Simulators via Hierarchical Feedback Decomposition	claim
10	170	Mobile Robot Navigation and Control: A Case Study	claim
11	167	Design and Implementation of a Replay Framework Based on a Partial Order Planner	claim
12	162	A Graph-Based Method for Improving GSAT	claim
13	160	Learning to Parse Database Queries Using Inductive Logic Programming	claim
14	159	Learning Models for Multi-Source Integration	claim
15	158	Estimating the Absolute Position of a Mobile Robot Using Position Probability Grids	claim
16	158	Splitting a Default Theory	claim
17	157	A Connectionist Framework for Reasoning: Reasoning with Examples	claim
18	157	Integrating Grid-Based and Topological Maps for Mobile Robot Navigation	claim
19	154	Turn-Taking in Discourse and Its Application To The Design of Intelligent Agents	claim
20	154	Agent Amplified Communication	claim
21	151	Spatial Aggregation: Language and Applications	claim
22	150	Irrelevance and Conditioning in First-Order Probabilistic Logic	claim
23	149	Post-Analysis of Learned Rules	claim
24	149	Forward Estimation for Game-Tree Search	claim
25	147	Trajectory Constraints in Qualitative Simulation	claim
26	147	Building Classifiers Using Bayesian Networks	claim
27	146	A Kernel-Oriented Model for Coalition-Formation in General Environments: Implementation and Results	claim
28	142	Exploiting Graph Properties of Game Trees	claim
29	139	Generation of Attributes for Learning Algorithms	claim
30	139	Robot Navigation Using Image Sequences	claim
31	138	Declarative Camera Control for Automatic Cinematography	claim
32	138	Generating Multiple New Designs From a Sketch	claim
33	135	First-Order Conditional Logic Revisited	claim
34	135	Planning to Gather Information	claim
35	134	What Is Planning in the Presence of Sensing?	claim
36	133	An Optimal Contracting Strategy in a Digital Library	claim
37	132	Agent Modeling in Expert Critiquing Systems	claim
38	132	Navigation for Everyday Life	claim
39	130	Reasoning about Continuous Processes	claim
40	127	A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem	claim
41	127	On the Range of Applicability of Baker's Approach to the Frame Problem	claim
42	126	Situation Calculus on a Dense Flow of Time	claim
43	125	Lazy Arc Consistency	claim
44	125	The NASA Personnel Security Processing Expert System	claim
45	124	Planning for Temporally Extended Goals	claim
46	124	Cooperator-Base + Task-Base For Agent Modeling: The Virtual Secretary Approach	claim
47	124	Interactive Information Retrieval Systems with Minimalist Representation	claim
48	124	Reasoning about Nondeterministic and Concurrent Actions: A Process Algebra Approach	claim
49	124	CommonKADS Models for Knowledge-Based Planning	claim
50	124	Opportunity Recognition in Complex Environments	claim
51	124	Motion and Color Analysis for Animat Perception	claim
52	123	Incorporating Opponent Models into Adversary Search	claim
53	123	Refinement Planning: Status and Prospectus	claim
54	122	Total-Order Multi-Agent Task-Network Planning for Contract Bridge	claim
55	121	A Clinician's Tool for Analyzing Non-Compliance	claim
56	121	Neighborhood Inverse Consistency Preprocessing	claim
57	121	Dynamically Sequencing an Animated Pedagogical Agent	claim
58	120	A Hybrid Learning Approach for Better Recognition of Visual Objects	claim
59	120	Comet: An Application of Model-Based Reasoning to Accounting Systems	claim
60	120	Noise and the Common Sense Informatic Situation for a Mobile Robot	claim
61	119	Rewarding Behaviors	claim
62	119	Generalizing Indexical-Functional Reference	claim
63	119	Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem	claim
64	118	Learning Models of Intelligent Agents	claim
65	118	Plausibility Measures and Default Reasoning	claim
66	118	The ContactFinder Agent: Answering Bulletin Board Questions with Referrals	claim
67	118	Supporting Performance and Configuration Management of GTE Cellular Networks	claim
68	118	Monitoring Frog Communities: An Application of Machine Learning	claim
69	117	Comparing Agent Modeling For Language and Action	claim
70	116	Monitoring the Progress of Anytime Problem-Solving	claim
71	116	Commitment Strategies in Hierarchical Task Network Planning	claim
72	115	Knowledge-Based Navigation of Complex Information Spaces	claim
73	115	Modeling Information Agents: Advertisement, Organizational Roles, and Dynamic Behavior	claim
74	115	Automatically Generating Extraction Patterns from Untagged Text	claim
75	114	Hierarchical A*: Searching Abstraction Hierarchies Efficiently	claim
76	114	Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search	claim
77	114	ReCognition and Critiquing of Erroneous Agent Actions	claim
78	114	Managing Occurrence Branching in Qualitative Simulation	claim
79	113	Coping with Temporal Constraints in Multimedia Presentation Planning	claim
80	113	Discovering Robust Knowledge from Dynamic Closed World Data	claim
81	113	The Complexity of Model Checking for Belief Revision and Update	claim
82	113	Constructive Neural Network Learning Algorithms	claim
83	112	Formalizing Narratives Using Nested Circumscription	claim
84	111	Moving Up the Information Food Chain: Deploying Softbots on the World Wide Web	claim
85	111	Sequential Inductive Learning	claim
86	111	An Incremental Interactive Algorithm for Regular Grammar Inference	claim
87	110	The SIGNAL Expert System	claim
88	109	Effects of Local Information on Group Behavior	claim
89	108	Scaling up Logic-Based Truth Maintenance Systems via Fact Garbage Collection	claim
90	107	Intelligent Retail Logistics Scheduling	claim
91	106	Machine Learning of User Profiles: Representational Issues	claim
92	106	Learning Procedural Planning Knowledge in Complex Environments	claim
93	106	Efficient Goal-Directed Exploration	claim
94	105	Easy and Hard Testbeds for Real-Time Search Algorithms	claim
95	105	Source Selection for Analogical Reasoning: An Empirical Approach	claim
96	104	Is "Early Commitment" in Plan Generation Ever a Good Idea?	claim
97	103	Learning in Multi-Agent Systems	claim
98	103	Deciding to Remind During Collaborative Problem Solving: Empirical Evidence for Agent Strategies	claim
99	103	SociAl Agents For Communicative Tasks	claim
100	103	Generalized Queries on Probabilistic Context-Free Grammars	claim
101	103	YODA: The Young Observant Discovery Agent	claim
102	102	Qualitative Multiple-Fault Diagnosis of Continuous Dynamic Systems Using Behavioral Modes	claim
103	101	Improving Case Retrieval by Remembering Questions	claim
104	101	Nearly Monotonic Problems: A Key to Effective FA/C Distributed Sensor Interpretation?	claim
105	101	Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction	claim
106	101	Inference-Based Constraint Satisfaction Supports Explanation	claim
107	100	Agent and Task Modeling at Honeywell	claim
108	97	Learning Efficient Rules by Maintaining the Explanation Structure	claim
109	96	Learning to Take Actions	claim
110	95	On the Size of Reactive Plans	claim
111	94	A Counterexample to Theorems of Cox and Fine	claim
112	93	Building Up Rhetorical Structure Trees	claim
113	92	Goal Oriented Symbolic Propagation in Bayesian Networks	claim
114	92	Linear Time Near-Optimal Planning in the Blocks World	claim
115	89	Significant Lexical Relationships	claim
116	88	On the Foundations of Qualitative Decision Theory	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers