CoRR, July 2002

• Ronald M. Fussell:
  National Infrastructure Contingencies: Survey of Wireless Technology Support.
  
• Mikhail Belkin, John A. Goldsmith:
  Using eigenvectors of the bigram graph to infer morpheme identity.
  
• Yasuko Senda, Yasusi Sinohara:
  Analysis of Titles and Readers For Title Generation Centered on the Readers.
  
• Jeff Erickson, Sariel Har-Peled:
  Optimally cutting a surface into a disk.
  
• Melanie Siegel, Emily M. Bender:
  Efficient Deep Processing of Japanese.
  
• W. Chen:
  Orthonormal RBF wavelet and ridgelet-like series and transforms for high-dimensional problems.
  
• Denis V. Popel, Nawar Al-Hakeem:
  Evolutionary Circuit Design: Information Theory Perspective on Signal Propagation.
  
• Frank S. de Boer, Koen V. Hindriks, Wiebe van der Hoek, John-Jules Ch. Meyer:
  Agent Programming with Declarative Goals.
  
• Vince Grolmusz:
  Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications.
  
• W. Chen:
  Symmetric boundary knot method.
  
• Denis V. Popel, Nawar Al-Hakeem:
  Improving Web Database Access Using Decision Diagrams.
  
• Denis V. Popel:
  Synthesis of Low-Power Digital Circuits Derived from Binary Decision Diagrams.
  
• Denis V. Popel:
  A Compact Graph Model of Handwritten Images: Integration into Authentification and Recognition.
  
• Denis V. Popel, Nawar Al-Hakeem:
  On the Information Engine of Circuit Design.
  
• W. Chen, M. Tanaka:
  New advances in dual reciprocity and boundary-only RBF methods.
  
• W. Chen, M. Tanaka:
  Relationship between boundary integral equation and radial basis function.
  
• W. Chen, M. Tanaka:
  New Insights in Boundary-only and Domain-type RBF Methods.
  
• W. Chen:
  Definitions of distance function in radial basis function approach.
  
• Denis V. Popel:
  Information Measures in Detecting and Recognizing Symmetries.
  
• Denis V. Popel:
  Towards Efficient Calculation of Information Measures for Reordering of Binary Decision Diagrams.
  
• Piero A. Bonatti:
  Abduction, ASP and Open Logic Programs.
  
• Mehdi Dastani, Leendert W. N. van der Torre:
  What is a Joint Goal? Games with Beliefs and Defeasible Desires.
  
• Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila A. McIlraith:
  Domain-Dependent Knowledge in Answer Set Planning.
  
• Paul E. Dunne:
  On Concise Encodings of Preferred Extensions.
  
• Claudette Cayrol, Sylvie Doutre, Marie-Christine Lagasquie-Schiex, Jérôme Mengin:
  "Minimal defence": a refinement of the preferred semantics for argumentation frameworks.
  
• Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu:
  Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications.
  
• Boaz Tsaban:
  Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation.
  
• Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
  Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP.
  
• Alexander Bochman:
  Two Representations for Iterative Non-prioritized Change.
  
• Alexander Bochman:
  Collective Argumentation.
  
• Henry Prakken:
  Intuitions and the modelling of defeasible reasoning: some case studies.
  
• Pedro Cabalar:
  Alternative Characterizations for Strong Equivalence of Logic Programs.
  
• W. Chen, Xinwei Wang, Yongxi Yu:
  Reducing the Computational Requirements of the Differential Quadrature Method.
  
• W. Chen, Weixing He, Tingxiu Zhong:
  A Note on the DQ Analysis of Anisotropic Plates.
  
• W. Chen, Tingxiu Zhong:
  A Lyapunov Formulation for Efficient Solution of the Poisson and Convection-Diffusion Equations by the Differential Quadrature Method.
  
• N. Allen, Timothy B. Terriberry:
  System Description for a Scalable, Fault-Tolerant, Distributed Garbage Collector.
  
• Samir Chopra, Johannes Heidema, Thomas Andreas Meyer:
  Some logics of belief and disbelief.
  
• Samir Chopra, Aditya Ghose, Thomas Andreas Meyer:
  Iterated revision and the axiom of recovery: a unified treatment via epistemic states.
  
• Masataka Tanaka, W. Chen:
  Dual reciprocity BEM and dynamic programming filter for inverse elastodynamic problems.
  
• Ralf Schweimeier, Michael Schroeder:
  Well-Founded Argumentation Semantics for Extended Logic Programming.
  
• W. Chen:
  RBF-based meshless boundary knot method and boundary particle method.
  
• Gerhard Brewka:
  Logic Programming with Ordered Disjunction.
  
• W. Chen, Masataka Tanaka:
  A meshless, integration-free, and boundary-only RBF technique.
  
• Ulrich Neumerkel, Stefan Kral:
  Declarative program development in Prolog with GUPU.
  
• Adnan Darwiche, Pierre Marquis:
  Compilation of Propositional Weighted Bases.
  
• Samir Ouis, Narendra Jussien, Patrice Boizumault:
  COINS: a constraint-based interactive solving system.
  
• Magnus Ågren, Tamás Szeredi, Nicolas Beldiceanu, Mats Carlsson:
  Tracing and Explaining Execution of CLP(FD) Programs.
  
• François Fages:
  CLPGUI: a generic graphical user interface for constraint logic programming over finite domains.
  
• Claudio Vaucheret, Francisco Bueno:
  More Precise Yet Efficient Type Inference for Logic Programs.
  
• Willy Lesaint:
  Value withdrawal explanations: a theoretical tool for programming environments.
  
• Nicos Angelopoulos:
  Exporting Prolog source code.
  
• Alexandre Tessier:
  Proceedings of the 12th International Workshop on Logic Programming Environments.
  
• Jan Wielemaker, Anjo Anjewierden:
  An Architecture for Making Object-Oriented Systems Available from Prolog.
  
• Göran Falkman, Olof Torgersson:
  Enhancing Usefulness of Declarative Programming Frameworks through Complete Integration.
  
• Mark Burgin:
  The Rise and Fall of the Church-Turing Thesis.
  
• Antonis C. Kakas, Loizos Michael:
  Modeling Complex Domains of Actions and Change.
  
• Samson Abramsky, Bob Coecke:
  Physical Traces: Quantum vs. Classical Information Processing.
  
• Jochen L. Leidner:
  Question Answering over Unstructured Data without Domain Restrictions.
  
• Trevor J. M. Bench-Capon:
  Value Based Argumentation Frameworks.
  
• Torsten Schaub, Kewen Wang:
  Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report.
  
• Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook:
  Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators.
  
• W. Chen:
  Some addenda on distance function wavelets.
  
• Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
  Parallel Delaunay Refinement: Algorithms and Analyses.
  
• Eyal Amir:
  Interpolation Theorems for Nonmonotonic Reasoning Systems.
  
• Dritan Berzati, Bernhard Anrig, Jürg Kohlas:
  Embedding Default Logic in Propositional Argumentation Systems.
  
• Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
  Polynomial Time Data Reduction for Dominating Set.
  
• Bart Verheij:
  On the existence and multiplicity of extensions in dialectical argumentation.
  
• Konstantin Korovin, Andrei Voronkov:
  Knuth-Bendix constraint solving is NP-complete.
  
• Ahmed Helmy:
  Small Large-Scale Wireless Networks: Mobility-Assisted Resource Discovery.
  
• Chung-chieh Shan:
  A continuation semantics of interrogatives that accounts for Baker's ambiguity.
  
• David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran:
  A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report.
  
• Marco Cadoli, Thomas Eiter, Georg Gottlob:
  Complexity of Nested Circumscription and Nested Abnormality Theories.
  
• Srinidhi Varadarajan, Naren Ramakrishnan:
  Reinforcing Reachable Routes.
  
• Dina Q. Goldin, Peter Wegner:
  Paraconsistency of Interactive Computation. 109-118
  
• Thomas Lukasiewicz:
  Nonmonotonic Probabilistic Logics between Model-Theoretic Probabilistic Logic and Probabilistic Logic under Coherence.
  
• Elisa Bertino, Barbara Catania, Paolo Perlasca:
  Introducing Dynamic Behavior in Amalgamated Knowledge Bases.
  
• Jahanzeb Sherwani, Nosheen Ali, Nausheen Lotia, Zahra Hayat, Rajkumar Buyya:
  Libra: An Economy driven Job Scheduling System for Clusters.
  
• András A. Benczúr, David R. Karger:
  Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs.
  
• Dima Grigoriev, Ilia V. Ponomarenko:
  On non-abelian homomorphic public-key cryptosystems.
  
• Dima Grigoriev:
  Public-key cryptography and invariant theory.
  
• Marshall W. Bern, David Eppstein:
  Moebius-Invariant Natural Neighbor Interpolation.
  
• David Eppstein:
  Dynamic Generators of Topologically Embedded Graphs.
  
• Henry E. Kyburg Jr., Choh-Man Teng:
  Evaluating Defaults.
  
• Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran:
  Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. 1-15
  
• Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe:
  Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning. 51-65
  
• Michael J. Maher:
  A Model-Theoretic Semantics for Defeasible Logic. 67-80
  
• Guo-Qiang Zhang:
  Axiomatic Aspects of Default Inference. 17-32
  
• Jørgen Villadsen:
  A Paraconsistent Higher Order Logic. 33-49
  
• Jan Maluszynski, Aida Vitória:
  Defining Rough Sets by Extended Logic Programs. 81-90
  
• Diderik Batens:
  On a Partial Decision Method for Dynamic Proofs. 91-108
  
• François Bry:
  An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning. 119-134
  
• Henryk Fuks, Anna T. Lawniczak, Stanislav Volkov:
  Packet delay in models of data networks.
  
• Jan Chomicki:
  Preference Queries.
  
• Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki:
  Answer Sets for Consistent Query Answering in Inconsistent Databases.
  
• Wim H. Hesselink:
  Eternity variables to prove simulation of specifications.
  
• Avery Ching, Alok N. Choudhary, Wei-keng Liao, Robert B. Ross, William Gropp:
  Noncontiguous I/O through PVFS.
  
• Jürgen Schmidhuber:
  Optimal Ordered Problem Solver.
  
• Alexei Vazquez, Martin Weigt:
  Computational complexity arising from degree correlations in networks.
  
• Marc Mézard, Federico Ricci-Tersenghi, Riccardo Zecchina:
  Alternative solutions to diluted p-spin models and XORSAT problems.
  
• Igor Bjelakovic, Tyll Krueger, Rainer Siegmund-Schultze, Arleta Szkola:
  The Shannon-McMillan Theorem for Ergodic Quantum Lattice Systems.
  

Last update Sat May 25 19:54:10 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page