The SCEAS System
Navigation Menu

Conferences in DBLP

Russian Conference on Logic Programming / (lpar)
2001 (conf/lpar/2001)

  1. Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev
    Monodic fragments of first-order temporal logics: 2000-2001 A.D. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:1-23 [Conf]
  2. Orna Kupferman, Moshe Y. Vardi
    On Bounded Specifications. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:24-38 [Conf]
  3. Klaus Schneider
    Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:39-54 [Conf]
  4. Volker Diekert, Paul Gastin
    Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:55-69 [Conf]
  5. Dietmar Berwanger, Erich Grädel
    Games and Model Checking for Guarded Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:70-84 [Conf]
  6. Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt
    Computational Space Efficiency and Minimal Model Generation for Guarded Formulae. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:85-99 [Conf]
  7. Natasha Alechina, Brian Logan
    Logical Omniscience and the Cost of Deliberation. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:100-109 [Conf]
  8. Sebastian Sardiña
    Local Conditional High-Level Robot Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:110-124 [Conf]
  9. Kai Engelhardt, Ron van der Meyden, Yoram Moses
    A Refinement Theory that Supports Reasoning About Knowledge and Time. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:125-141 [Conf]
  10. Reinhold Letz, Gernot Stenz
    Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:142-156 [Conf]
  11. Joseph D. Horton
    Counting the Number of Equivalent Binary Resolution Proofs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:157-171 [Conf]
  12. Hans de Nivelle
    Splitting Through New Proposition Symbols. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:172-185 [Conf]
  13. Christopher Lynch, Barbara Morawska
    Complexity of Linear Standard Theories. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:186-200 [Conf]
  14. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
    Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:201-215 [Conf]
  15. Franz Baader, Ralf Küsters
    Unification in a Description Logic with Transitive Closure of Roles. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:217-232 [Conf]
  16. Guy Perrier
    Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:233-248 [Conf]
  17. Yong Luo, Zhaohui Luo
    Coherence and Transitivity in Coercive Subtyping. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:249-265 [Conf]
  18. Carsten Schürmann
    A Type-Theoretic Approach to Induction with Higher-Order Encodings. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:266-281 [Conf]
  19. Jan-Georg Smaus
    Analysis of Polymorphically Typed Logic Programs Using ACI-Unification. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:282-298 [Conf]
  20. Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa
    Model Generation with Boolean Constraints. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:299-308 [Conf]
  21. Bijan Afshordel, Thomas Hillenbrand, Christoph Weidenbach
    First-Order Atom Definitions Extended. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:309-319 [Conf]
  22. Thomas Marthedal Rasmussen
    Automated Proof Support for Interval Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:320-329 [Conf]
  23. Daniel Leivant
    The Functions Provable by First Order Abstraction. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:330-346 [Conf]
  24. Kai Brünnler, Alwen Fernanto Tiu
    A Local System for Classical Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:347-361 [Conf]
  25. Jussi Rintanen
    Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:362-376 [Conf]
  26. Toby Walsh
    Permutation Problems and Channelling Constraints. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:377-391 [Conf]
  27. Alvaro del Val
    Simplifying Binary Propositional Theories into Connected Components Twice as Fast. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:392-406 [Conf]
  28. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Reasoning about Evolving Nonmonotonic Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:407-421 [Conf]
  29. Andreas Behrend
    Efficient Computation of the Well-Founded Model Using Update Propagation. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:422-437 [Conf]
  30. Gianluca Amato, James Lipton
    Indexed Categories and Bottom-Up Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:438-454 [Conf]
  31. Francisco Javier López-Fraguas, Jaime Sánchez-Hernández
    Functional Logic Programming with Failure: A Set-Oriented View. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:455-469 [Conf]
  32. Stephan Kreutzer
    Operational Semantics for Fixed-Point Logics on Constraint Databases. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:470-484 [Conf]
  33. Susana Muñoz-Hernández, Juan José Moreno-Navarro, Manuel V. Hermenegildo
    Efficient Negation Using Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:485-494 [Conf]
  34. Sylvain Boulmé, Grégoire Hamon
    Certifying Synchrony for Free. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:495-506 [Conf]
  35. David McMath, Marianna Rozenfeld, Richard Sommer
    A Computer Environment for Writing Ordinary Mathematical Proofs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:507-516 [Conf]
  36. Alexander Serebrenik, Danny De Schreye
    On Termination of Meta-Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:517-530 [Conf]
  37. Cristina Borralleras, Albert Rubio
    A Monotonic Higher-Order Semantic Path Ordering. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:531-547 [Conf]
  38. Robert Baumgartner, Sergio Flesca, Georg Gottlob
    The Elog Web Extraction Language. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:548-560 [Conf]
  39. Enrico Franconi, Antonio Laureti Palma, Nicola Leone, Simona Perri, Francesco Scarcello
    Census Data Repair: a Challenging Application of Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:561-578 [Conf]
  40. Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill
    Boolean Functions for Finite-Tree Dependencies. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:579-594 [Conf]
  41. Marco Comini, Roberta Gori, Giorgio Levi
    How to Transform an Analyzer into a Verifier. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:595-609 [Conf]
  42. Rong Yang, Steve Gregory
    Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Search. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:610-623 [Conf]
  43. Ofer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe
    Coherent Composition of Distributed Knowledge-Bases Through Abduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:624-638 [Conf]
  44. Christian G. Fermüller, Georg Moser, Richard Zach
    Tableaux for Reasoning About Atomic Updates. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:639-653 [Conf]
  45. Alexander Serebrenik, Danny De Schreye
    Inference of Termination Conditions for Numerical Loops in Prolog. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:654-668 [Conf]
  46. Salvador Lucas
    Termination of Rewriting With Strategy Annotations. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:669-684 [Conf]
  47. Samir Genaim, Michael Codish
    Inferring Termination Conditions for Logic Programs Using Backwards Analysis. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:685-694 [Conf]
  48. Thomas Genet, Valérie Viet Triem Tong
    Reachability Analysis of Term Rewriting Systems with Timbuk. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:695-706 [Conf]
  49. Wim Vanhoof, Maurice Bruynooghe
    Binding-Time Annotations Without Binding-Time Analysis. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:707-722 [Conf]
  50. Raul Monroy
    Concept Formation via Proof Planning Failure. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:723-736 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002