IJCAI 2003 - PDF Preprint Papers

IJCAI 2003

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IJCAI-2003 Paper

click to vote

IJCAI
2003

220views Artificial Intelligence» more IJCAI 2003»

Backbone Guided Local Search for Maximum Satisfiability

14 years 24 days ago

Download dli.iiit.ac.in

Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...

Weixiong Zhang, Ananda Rangan, Moshe Looks

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	220	Backbone Guided Local Search for Maximum Satisfiability	claim
2	209	Integrating Background Knowledge Into Text Classification	claim
3	193	When Discriminative Learning of Bayesian Network Parameters Is Easy	claim
4	188	A Bayesian Approach to Imitation in Reinforcement Learning	claim
5	186	The Concurrent, Continuous FLUX	claim
6	185	Continuous nonlinear dimensionality reduction by kernel Eigenmaps	claim
7	184	Automated Reasoning: Past Story and New Trends	claim
8	182	Decidability of SHIQ with Complex Role Inclusion Axioms	claim
9	177	FastSLAM 2.0: An Improved Particle Filtering Algorithm for Simultaneous Localization and Mapping that Provably Converges	claim
10	176	Bayesian Information Extraction Network	claim
11	173	On the application of least-commitment and heuristic search in temporal planning	claim
12	173	A Planning Algorithm for Predictive State Representations	claim
13	172	Mining Video Associations for Efficient Database Management	claim
14	171	Constructing Diverse Classifier Ensembles using Artificial Training Examples	claim
15	169	Covariant Policy Search	claim
16	168	A Logic For Causal Reasoning	claim
17	168	Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV	claim
18	167	Minimal Change and Maximal Coherence for Epistemic Logic Program Updates	claim
19	163	Does a New Simple Gaussian Weighting Approach Perform Well in Text Categorization?	claim
20	163	In Defense of PDDL Axioms	claim
21	160	A Method for Semantically Enhancing the Service Discovery Capabilities of UDDI	claim
22	158	Local-Effect Games	claim
23	155	Coherent Keyphrase Extraction via Web Mining	claim
24	152	Integrating Information to Bootstrap Information Extraction from Web Sites	claim
25	152	Automatically attaching semantic metadata to Web Services	claim
26	152	SVMC: Single-Class Classification With Support Vector Machines	claim
27	152	Domain Event Extraction and Representation with Domain Ontology	claim
28	150	Dynamic Bayesian modeling of the cerebral activity	claim
29	149	Constructing utility models from observed negotiation actions	claim
30	148	Query rewriting and answering under constraints in data integration systems	claim
31	148	Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems	claim
32	147	Answer Set Optimization	claim
33	147	Approximate Policy Iteration using Large-Margin Classifiers	claim
34	146	Towards Pervasive Robotics	claim
35	145	Employing Trainable String Similarity Metrics for Information Integration	claim
36	145	Compiling Control Knowledge into Preconditions for Planning in the Situation Calculus	claim
37	145	A lookahead strategy for solving large planning problems	claim
38	144	On the Undecidability of Description and Dynamic Logics with Recursion and Counting	claim
39	144	Collaborative Filtering Using Associative Neural Memory	claim
40	143	Amalgams of Constraint Satisfaction Problems	claim
41	142	Broadcast News Navigator (BNN) Demonstration	claim
42	142	Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings	claim
43	141	Automatic Video Interpretation: A Novel Algorithm for Temporal Scenario Recognition	claim
44	140	Statistics Gathering for Learning from Distributed, Heterogeneous and Autonomous Data Sources	claim
45	140	An Extension of the ICP Algorithm for Modeling Nonrigid Objects with Mobile Robots	claim
46	140	Virtual World as Interface for Human-Robot Interaction	claim
47	140	Comparing image-based localization methods	claim
48	140	Behavior Bounding: Toward Effective Comparisons of Agents & Humans	claim
49	139	Comparing Different Cognitive Paradigms with a Virtual Laboratory	claim
50	139	Identifying Synonyms among Distributionally Similar Words	claim
51	138	A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases	claim
52	137	Approximating Optimal Policies for Agents with Limited Execution Resources	claim
53	137	Distributed Clustering Based on Sampling Local Density Estimates	claim
54	137	Assertion Application in Theorem Proving and Proof Planning	claim
55	136	An Improved Algorithm for Optimal Bin Packing	claim
56	135	Writer's Aid: Using a Planner in a Collaborative Interface	claim
57	134	A Continuation Method for Nash Equilibria in Structured Games	claim
58	134	DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks	claim
59	134	Intelligent Multimedia Indexing and Retrieval through Multi-source Information Extraction and Merging	claim
60	134	Demonstration: Liaison Agents for Distributed Space Operations	claim
61	134	Consistency and Set Intersection	claim
62	133	Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems	claim
63	133	Action representation and partially observable planning using epistemic logic	claim
64	133	Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment	claim
65	133	Trainability: Developing a responsive learning system	claim
66	133	A Semantic-Based User Privacy Protection Framework for Web Services	claim
67	132	Hierarchical Hidden Markov Models for Information Extraction	claim
68	132	Efficient Execution of Recursive Integration Plans	claim
69	132	Backdoors To Typical Case Complexity	claim
70	131	Layered Mereotopology	claim
71	130	Combining Classification and Transduction for Value Prediction in Speculative Plan Execution	claim
72	130	Learning to Classify Texts Using Positive and Unlabeled Data	claim
73	130	Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies	claim
74	130	Multiple-Goal Reinforcement Learning with Modular Sarsa(0)	claim
75	130	Temporal Reasoning with Preferences and Uncertainty	claim
76	130	Automated Generation of Graphic Sketches by Example	claim
77	129	Boosting Face Identification in Airports	claim
78	129	Integrity and Change in Modular Ontologies	claim
79	128	Body Movement Analysis of Human-Robot Interaction	claim
80	128	Keys, Nominals, and Concrete Domains	claim
81	125	Definition and Complexity of Some Basic Metareasoning Problems	claim
82	125	GRAEL: an agent-based evolutionary computing approach for natural language grammar development	claim
83	125	Concept Linking for Information Integration in Open Book and Sentinel	claim
84	124	Causes and Explanations Revisited	claim
85	123	Automated Generation of Understandable Contingency Plans	claim
86	123	Case-Based Recommender Systems: A Unifying View	claim
87	123	Phase Transitions of the Asymmetric Traveling Salesman	claim
88	122	On the Design of Social Diagnosis Algorithms for Multi-Agent Teams	claim
89	122	In the quest of the best form of local consistency for Weighted CSP	claim
90	122	Integrating Information, Applications and Services on the Web	claim
91	122	Action Selection for Single- and Multi-Robot Tasks Using Cooperative Extended Kohonen Maps	claim
92	122	Non-Invasive Brain-Actuated Control of a Mobile Robot	claim
93	122	Point-based value iteration: An anytime algorithm for POMDPs	claim
94	122	Gaussian Process Models of Spatial Aggregation Algorithms	claim
95	121	A Logic-based Algorithm for Image Sequence Interpretation and Anchoring	claim
96	121	Variable Resolution Particle Filter	claim
97	120	Active Probing Strategies for Problem Diagnosis in Distributed Systems	claim
98	120	Information Extraction from Tree Documents by Learning Subtree Delimiters	claim
99	120	LADDER: A Language to Describe Drawing, Display, and Editing in Sketch Recognition	claim
100	120	Quantifying information and contradiction in propositional logic through test actions	claim
101	119	Efficient Symmetry Breaking for Boolean Satisfiability	claim
102	119	Spectral Learning	claim
103	119	The Compass Filter: Search Engine Result Personalization Using Web Communities	claim
104	119	Generalizing GraphPlan by Formulating Planning as a CSP	claim
105	119	An Integrated Multilevel Learning Approach to Multiagent Coalition Formation	claim
106	119	Incremental Utility Elicitation with the Minimax Regret Decision Criterion	claim
107	118	Visual Programming of Web Data Aggregation Applications	claim
108	118	Simultaneous Adversarial Multi-Robot Learning	claim
109	118	Building Data Integration Systems: A Mass Collaboration Approach	claim
110	118	People Tracking with Anonymous and ID-Sensors Using Rao-Blackwellised Particle Filters	claim
111	117	A General Model for Online Probabilistic Plan Recognition	claim
112	117	A Learning Algorithm for Web Page Scoring Systems	claim
113	117	Intelligent Multimodal Stream Processing	claim
114	117	Automatic Abstraction in Component-Based Diagnosis Driven by System Observability	claim
115	116	Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving	claim
116	116	On the Foundations of Expected Expected Utility	claim
117	116	IKUM: An Integrated Web Personalization Platform Based on Content Structures and User Behavior	claim
118	115	Making the Breakout Algorithm Complete Using Systematic Search	claim
119	115	Practical Partition-Based Theorem Proving for Large Knowledge Bases	claim
120	115	Improving Coevolutionary Search for Optimal Multiagent Behaviors	claim
121	113	Protocol Conformance for Logic-based Agents	claim
122	113	Challenges in Web Search Engines	claim
123	113	Coherence of Laws	claim
124	113	Web Page Cleaning for Web Mining through Feature Weighting	claim
125	112	Learning Minesweeper with Multirelational Learning	claim
126	112	Formal Verification of Diagnosability via Symbolic Model Checking	claim
127	112	Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach	claim
128	112	A Revised Algorithm for Latent Semantic Analysis	claim
129	112	Consistent, Convergent, and Constant-Time SLAM	claim
130	112	Scenario-based Stochastic Constraint Programming	claim
131	112	Dynamics of Coalition Formation in Combinatorial Trading	claim
132	111	Monte Carlo Theory as an Explanation of Bagging and Boosting	claim
133	111	Generalizing Plans to New Environments in Relational MDPs	claim
134	111	Artificial Neural Network for Sequence Learning	claim
135	111	Getting Serious about the Development of Computational Humor	claim
136	111	Switching Hypothesized Measurements: A Dynamic Model with Applications to Occlusion Adaptive Joint Tracking	claim
137	110	Intelligent Techniques for Web Personalization	claim
138	110	Semi-Supervised Learning with Explicit Misclassification Modeling	claim
139	110	Multiagent Planning with Partially Ordered Temporal Plans	claim
140	110	Inductive Learning in Less Than One Sequential Data Scan	claim
141	110	Deploying Information Agents on the Web	claim
142	110	Describing Additive Fluents in Action Language C+	claim
143	110	Exploring Unknown Environments with Mobile Robots using Coverage Maps	claim
144	110	A Statistical Model for Flexible String Similarity	claim
145	109	Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback	claim
146	109	Where is ...? Learning and Utilizing Motion Patterns of Persons with Mobile Robots	claim
147	109	The Knowledge Required to Interpret Noun Compounds	claim
148	109	The Traits of the Personable	claim
149	108	Logical Filtering	claim
150	108	Biologically-Inspired Self-Assembly of Two-Dimensional Shapes Using Global-to-Local Compilation	claim
151	108	TAGA: Travel Market Framework in Agentcities	claim
152	107	Dynamic Vehicle Routing with Stochastic Requests	claim
153	107	Great Expectations. Part II: Generalized Expected Utility as a Universal Decision Rule	claim
154	107	Recognizing Plan/Goal Abandonment	claim
155	107	Deep Annotation for Information Integration	claim
156	107	Causal Theories of Action: A Computational Core	claim
157	107	Abductive Matchmaking using Description Logics	claim
158	106	Categorizing classes of signals by means of fuzzy gradual rules	claim
159	106	Incremental Tractable Reasoning about Qualitative Temporal Constraints	claim
160	106	Evaluating Significance of Inconsistencies	claim
161	106	AUC: a Statistically Consistent and more Discriminating Measure than Accuracy	claim
162	106	Toward Conditional Models of Identity Uncertainty with Application to Proper Noun Coreference	claim
163	105	Optimal Time-Space Tradeoff in Probabilistic Inference	claim
164	105	Approximating Game-Theoretic Optimal Strategies for Full-scale Poker	claim
165	105	Registry-Based Support for Information Integration	claim
166	105	Ordering Default Theories	claim
167	105	Automated Verification: Graphs, Logic, and Automata	claim
168	105	Quantum Computation and Image Processing: New Trends in Artificial Intelligence	claim
169	104	A Formalization of Equilibria for Multiagent Planning	claim
170	104	On the Revision of Probabilistic Beliefs using Uncertain Evidence	claim
171	104	A Maximal Tractable Class of Soft Constraints	claim
172	104	Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques	claim
173	104	A Learning-Based Jam Session System that Imitates a Player's Personality Model	claim
174	104	When Evolving Populations is Better than Coevolving Individuals: The Blind Mice Problem	claim
175	104	Active Learning with Strong and Weak Views: A Case Study on Wrapper Induction	claim
176	104	Combining Two Local Search Approaches to Hypergraph Partitioning	claim
177	103	Learning Value Predictors for the Speculative Execution of Information Gathering Plans	claim
178	103	A Comparison of String Distance Metrics for Name-Matching Tasks	claim
179	103	Expressive Power of Tree and String Based Wrappers	claim
180	103	Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems	claim
181	103	A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint	claim
182	103	Distributed Patient Scheduling in Hospitals	claim
183	103	Qualitative Map Learning Based on Co-visibility of Objects	claim
184	102	A Theory of Average-Case Compilability in Knowledge Representation	claim
185	102	Multiple Agents Moving Target Search	claim
186	102	NoA - A Normative Agent Architecture	claim
187	102	Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference	claim
188	102	Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction	claim
189	101	Source Update Capture in Information Agents	claim
190	101	A New Look at the Semantics and Optimization Methods of CP-Networks	claim
191	101	A Logic Prover for Text Processing	claim
192	101	Frequency-Based Coverage Statistics Mining for Data Integration	claim
193	101	Automated Qualitative Domain Abstraction	claim
194	100	Evaluating Coverage for Large Symbolic NLG Grammars	claim
195	100	On a generalization of triangulated graphs for domains decomposition of CSPs	claim
196	100	Multiset Ordering Constraints	claim
197	100	Improving Word Sense Disambiguation in Lexical Chaining	claim
198	100	Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems	claim
199	100	Improving the Performance of Recommender Systems That Use Critiquing	claim
200	99	Neural Executive Attentional Control in Robots	claim
201	99	Use of Off-line Dynamic Programming for Efficient Image Interpretation	claim
202	99	Predicting Web Information Content	claim
203	98	Tucking RCC in Cyc's Ontological Bed	claim
204	98	Corpus-Based Knowledge Representation	claim
205	98	An Epistemic Logic for Arbitration (Extended Abstract)	claim
206	97	Evaluating Classifiers by Means of Test Data with Noisy Labels	claim
207	96	Extended Gloss Overlaps as a Measure of Semantic Relatedness	claim
208	96	Making Markets and Democracy Work: A Story of Incentives and Computing	claim
209	96	Interactive Spoken Simulation Control and Conversational Tutoring	claim
210	96	Using Available Memory to Transform Graphplan's Search	claim
211	95	Propagation Redundancy for Permutation Channels	claim
212	95	Spaces of Theories with Ideal Refinement Operators	claim
213	95	Tractable Symmetry Breaking for CSPs with Interchangeable Values	claim
214	95	Personalisation of Web Search	claim
215	95	Increasing Dialogue Efficiency in Case-Based Reasoning Without Loss of Solution Quality	claim
216	95	Inducing criteria for lexicalization parts of speech using the Cyc KB	claim
217	94	On Identifying and Managing Relationships in Multi-Agent Systems	claim
218	94	Terminological Cycles in a Description Logic with Existential Restrictions	claim
219	94	Complexity Results about Nash Equilibria	claim
220	93	Evaluating Matching Algorithms: the Monotonicity Principle	claim
221	93	Logic Programs for Consistently Querying Data Integration Systems	claim
222	93	Great Expectations. Part I: On the Customizability of Generalized Expected Utility	claim
223	93	Probabilistically Survivable MASs	claim
224	93	Learning Algorithms for Software Agents in Uncertain and Untrusted Market Environments	claim
225	92	Network Meta-Reasoning for Information Assurance in Mobile Agent Systems	claim
226	92	Lookahead Pathologies for Single Agent Search	claim
227	92	Data Clustering: Principal Components, Hopfield and Self-Aggregation Networks	claim
228	92	On the Power of Semantic Partitioning of Web Documents	claim
229	91	Comparison of Different Grid Abstractions for Pathfinding on Maps	claim
230	91	Universal Voting Protocol Tweaks to Make Manipulation Hard	claim
231	91	A semantic framework for multimedia document adaptation	claim
232	91	Extending DTGOLOG with Options	claim
233	91	Imitation Learning of Team-play in Multiagent System based on Hidden Markov Modeling	claim
234	91	Thin Junction Tree Filters for Simultaneous Localization and Mapping	claim
235	90	Towards Inconsistency Management in Data Integration Systems	claim
236	90	Modeling Web Navigation: Methods and Challenges	claim
237	89	Finite Domain Constraint Solver Learning	claim
238	89	Explicit vs Implicit Profiling - A Case-Study in Electronic Programme Guides	claim
239	89	Modular self-organization for a long-living autonomous agent	claim
240	89	Qualitatively Faithful Quantitative Prediction	claim
241	89	Sparse-Memory Graph Search	claim
242	88	Understanding the Power of Clause Learning	claim
243	87	An Ontology-based Architecture for Cooperative Information Agents	claim
244	87	SMDP Homomorphisms: An Algebraic Approach to Abstraction in Semi-Markov Decision Processes	claim
245	87	A Learning Algorithm for Localizing People Based on Wireless Signal Strength that Uses Labeled and Unlabeled Data	claim
246	86	Multi-prototype Support Vector Machine	claim
247	86	First-order probabilistic inference	claim
248	85	Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems	claim
249	85	Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems	claim
250	85	Recycling Computed Answers in Rewrite Systems for Abduction	claim
251	84	Integrating Multiple Internet Directories by Instance-based Learning	claim
252	84	ODISET: On-line Distributed Session Tracing using Agents	claim
253	84	Engineering a complex ontology with time	claim
254	84	Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems	claim
255	81	Weak Conditional Logics of Normality	claim
256	81	A Visual-Sensor Model for Mobile Robot Localisation	claim
257	80	An Ontology-Based Knowledge Management Platform	claim
258	80	A Structure-Based Variable Ordering Heuristic for SAT	claim
259	79	Corpus-based, Statistical Goal Recognition	claim
260	79	Sampling Combinatorial Spaces Using Biased Random Walks	claim
261	79	Factored A* Search for Models over Sequences and Trees	claim
262	77	A Parametric Hierarchical Planner for Experimenting Abstraction Techniques	claim
263	76	Learning to Compete in Heterogeneous Web Search Environments	claim
264	75	Efficient Representation of Adhoc Constraints	claim
265	75	Qualitative Decision under Uncertainty: Back to Expected Utility	claim
266	75	Minimally intrusive negotiating agents for resource sharing	claim
267	74	Channeling Constraints and Value Ordering in the QuasiGroup Completion Problem	claim
268	72	Phase Transitions of Bounded Satisfiability Problems	claim
269	71	Tractable Pareto Optimization of Temporal Preferences	claim
270	69	Towards domain-independent, task-oriented, conversational adequacy	claim
271	69	A New Node Centroid Algorithm for Bandwidth Minimization	claim
272	66	A Portfolio Approach to Algorithm Selection	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers