


default search action
9th LPAR 2002: Tbilisi, Georgia
- Matthias Baaz, Andrei Voronkov:

Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings. Lecture Notes in Computer Science 2514, Springer 2002, ISBN 3-540-00010-0 - María Alpuente

, Santiago Escobar
, Bernhard Gramlich, Salvador Lucas:
Improving On-Demand Strategy Annotations. 1-18 - Krzysztof R. Apt, C. F. M. Vermeulen:

First-Order Logic as a Constraint Programming Language. 19-35 - Serge Autexier

, Dieter Hutter
:
Maintenance of Formal Software Developments by Stratified Verification. 36-52 - Arnold Beckmann:

A Note on Universal Measures for Weak Implicit Computational Complexity. 53-67 - Benedikt Bollig, Martin Leucker

, Philipp Lucas:
Extending Compositional Message Sequence Graphs. 68-85 - James Brotherston, Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa:

Searching for Invariants Using Temporal Resolution. 86-101 - Claudio Castellini

, Alan Smaill:
Proof Planning for Feature Interactions: A Preliminary Report. 102-114 - Mehdi Dastani, Leendert W. N. van der Torre

:
An Extension of BDICTL with Functional Dependencies and Components. 115-129 - Gilles Dowek, Thérèse Hardin, Claude Kirchner:

Binding Logic: Proofs and Models. 130-144 - Stefan Edelkamp, Peter Leven:

Directed Automated Theorem Proving. 145-159 - Xiaocong Fan, John Yen:

A Framework for Splitting BDI Agents. 160-174 - Mauro Ferrari

, Camillo Fiorentini, Guido Fiorino:
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. 175-189 - Pascal Fontaine, E. Pascal Gribomont:

Using BDDs with Combinations of Theories. 190-201 - Fabio Grandi

:
On Expressive Description Logics with Composition of Roles in Number Restrictions. 202-215 - Gianluigi Greco, Sergio Greco

, Irina Trubitsyna, Ester Zumpano:
Query Optimization of Disjunctive Databases with Constraints through Binding Propagation. 216-230 - Alessio Guglielmi, Lutz Straßburger:

A Non-commutative Extension of MELL. 231-246 - Dusan Guller:

Procedural Semantics for Fuzzy Disjunctive Programs. 247-261 - Orna Kupferman, Nir Piterman, Moshe Y. Vardi:

Pushdown Specifications. 262-277 - Temur Kutsia

:
Theorem Proving with Sequence Variables and Flexible Arity Symbols. 278-291 - Annabelle McIver, Carroll Morgan:

Games, Probability and the Quantitative µ-Calculus qMµ. 292-310 - Joachim Niehren, Mateu Villaret

:
Parallelism and Tree Regular Constraints. 311-326 - Norbert Preining:

Gödel Logics and Cantor-Bendixon Analysis. 327-336 - Julian Richardson:

A Semantics for Proof Plans with Applications to Interactive Proof Planning. 337-351 - José Espírito Santo

:
An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction. 352-366 - Jörg H. Siekmann, Christoph Benzmüller, Armin Fiedler, Andreas Meier, Martin Pollet:

Proof Development with Omega-MEGA: sqrt(2) Is Irrational. 367-387 - Lutz Straßburger:

A Local System for Linear Logic. 388-402 - Martin Strecker

:
Investigating Type-Certifying Compilation with Isabelle. 403-417 - Don Syme, Andrew D. Gordon:

Automating Type Soundness Proofs via Decision Procedures and Guided Reductions. 418-434 - Sergio Tessaris, Ian Horrocks:

Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics. 435-449 - Claudio Vaucheret, Sergio Guadarrama, Susana Muñoz-Hernández:

Fuzzy Prolog: A Simple General Implementation Using CLP(R). 450-464

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














