Search results for "LPAR"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta	Computing Preferred Answer Sets in Answer Set Programming.	LPAR	2003	DBLP DOI BibTeX RDF
1	Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001	Improving Dependency Pairs.	LPAR	2003	DBLP DOI BibTeX RDF
1	Didier Galmiche, J.-M. Notin	Connection-Based Proof Construction in Non-commutative Logic.	LPAR	2003	DBLP DOI BibTeX RDF
1	Boris Konev, Anatoli Degtyarev, Michael Fisher 0001	Handling Equality in Monodic Temporal Resolution.	LPAR	2003	DBLP DOI BibTeX RDF
1	Martin Fränzle, Christian Herde	Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems.	LPAR	2003	DBLP DOI BibTeX RDF	non-clausal propositional logic, zero-one linear constraint systems, Satisfiability, proof search, acceleration techniques
1	Serge Autexier, Carsten Schürmann	Disproving False Conjectures.	LPAR	2003	DBLP DOI BibTeX RDF
1	Barbara Morawska 0001	Completeness of E-Unification with Eager Variable Elimination.	LPAR	2003	DBLP DOI BibTeX RDF
1	Thierry Boy de la Tour, Mnacho Echenim	NP-Completeness Results for Deductive Problems on Stratified Terms.	LPAR	2003	DBLP DOI BibTeX RDF
1	Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre	An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.	LPAR	2003	DBLP DOI BibTeX RDF
1	Fabio Grandi 0001	On Expressive Description Logics with Composition of Roles in Number Restrictions.	LPAR	2002	DBLP DOI BibTeX RDF
1	James Brotherston, Anatoli Degtyarev, Michael Fisher 0001, Alexei Lisitsa 0001	Searching for Invariants Using Temporal Resolution.	LPAR	2002	DBLP DOI BibTeX RDF
1	Sergio Tessaris, Ian Horrocks 0001	Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics.	LPAR	2002	DBLP DOI BibTeX RDF
1	Lutz Straßburger	A Local System for Linear Logic.	LPAR	2002	DBLP DOI BibTeX RDF
1	Norbert Preining	Gödel Logics and Cantor-Bendixon Analysis.	LPAR	2002	DBLP DOI BibTeX RDF
1	Claudio Castellini, Alan Smaill	Proof Planning for Feature Interactions: A Preliminary Report.	LPAR	2002	DBLP DOI BibTeX RDF
1	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Pushdown Specifications.	LPAR	2002	DBLP DOI BibTeX RDF
1	Benedikt Bollig, Martin Leucker, Philipp Lucas 0001	Extending Compositional Message Sequence Graphs.	LPAR	2002	DBLP DOI BibTeX RDF
1	Pascal Fontaine, E. Pascal Gribomont	Using BDDs with Combinations of Theories.	LPAR	2002	DBLP DOI BibTeX RDF
1	Mauro Ferrari 0002, Camillo Fiorentini, Guido Fiorino	On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.	LPAR	2002	DBLP DOI BibTeX RDF
1	Martin Strecker	Investigating Type-Certifying Compilation with Isabelle.	LPAR	2002	DBLP DOI BibTeX RDF
1	Stefan Edelkamp, Peter Leven	Directed Automated Theorem Proving.	LPAR	2002	DBLP DOI BibTeX RDF
1	Dusan Guller	Procedural Semantics for Fuzzy Disjunctive Programs.	LPAR	2002	DBLP DOI BibTeX RDF	multivalued logic programming, logic in artificial intelligence, fuzzy logic, knowledge representation and reasoning, model theory, disjunctive logic programming
1	José Espírito Santo	An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction.	LPAR	2002	DBLP DOI BibTeX RDF
1	Claudio Vaucheret, Sergio Guadarrama, Susana Muñoz-Hernández	Fuzzy Prolog: A Simple General Implementation Using CLP(R).	LPAR	2002	DBLP DOI BibTeX RDF	Fuzzy Prolog, Constraint Programming Application, Implementation of Fuzzy Prolog, Logic Programming, Modeling Uncertainty
1	Temur Kutsia	Theorem Proving with Sequence Variables and Flexible Arity Symbols.	LPAR	2002	DBLP DOI BibTeX RDF
1	Annabelle McIver, Carroll Morgan	Games, Probability and the Quantitative µ-Calculus qMµ.	LPAR	2002	DBLP DOI BibTeX RDF
1	Mehdi Dastani, Leendert W. N. van der Torre	An Extension of BDICTL with Functional Dependencies and Components.	LPAR	2002	DBLP DOI BibTeX RDF
1	Don Syme, Andrew D. Gordon 0001	Automating Type Soundness Proofs via Decision Procedures and Guided Reductions.	LPAR	2002	DBLP DOI BibTeX RDF
1	Joachim Niehren, Mateu Villaret	Parallelism and Tree Regular Constraints.	LPAR	2002	DBLP DOI BibTeX RDF	unification, tree automata, computational logic
1	Gilles Dowek, Thérèse Hardin, Claude Kirchner	Binding Logic: Proofs and Models.	LPAR	2002	DBLP DOI BibTeX RDF
1	Xiaocong Fan, John Yen	A Framework for Splitting BDI Agents.	LPAR	2002	DBLP DOI BibTeX RDF
1	Serge Autexier, Dieter Hutter	Maintenance of Formal Software Developments by Stratified Verification.	LPAR	2002	DBLP DOI BibTeX RDF
1	María Alpuente, Santiago Escobar 0001, Bernhard Gramlich, Salvador Lucas	Improving On-Demand Strategy Annotations.	LPAR	2002	DBLP DOI BibTeX RDF	on-demand strategy annotations, lazy evaluation, Declarative programming, demandness, OBJ
1	Gianluigi Greco, Sergio Greco, Irina Trubitsyna, Ester Zumpano	Query Optimization of Disjunctive Databases with Constraints through Binding Propagation.	LPAR	2002	DBLP DOI BibTeX RDF
1	Alessio Guglielmi, Lutz Straßburger	A Non-commutative Extension of MELL.	LPAR	2002	DBLP DOI BibTeX RDF
1	Matthias Baaz, Andrei Voronkov (eds.)	Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings	LPAR	2002	DBLP DOI BibTeX RDF
1	Arnold Beckmann	A Note on Universal Measures for Weak Implicit Computational Complexity.	LPAR	2002	DBLP DOI BibTeX RDF	Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
1	Krzysztof R. Apt, C. F. M. Vermeulen	First-Order Logic as a Constraint Programming Language.	LPAR	2002	DBLP DOI BibTeX RDF
1	Julian Richardson	A Semantics for Proof Plans with Applications to Interactive Proof Planning.	LPAR	2002	DBLP DOI BibTeX RDF
1	Jörg H. Siekmann, Christoph Benzmüller, Armin Fiedler, Andreas Meier 0002, Martin Pollet	Proof Development with Omega-MEGA: sqrt(2) Is Irrational.	LPAR	2002	DBLP DOI BibTeX RDF
1	Thomas Genet, Valérie Viet Triem Tong	Reachability Analysis of Term Rewriting Systems with Timbuk.	LPAR	2001	DBLP DOI BibTeX RDF
1	Kai Brünnler, Alwen Fernanto Tiu	A Local System for Classical Logic.	LPAR	2001	DBLP DOI BibTeX RDF
1	Carsten Schürmann	A Type-Theoretic Approach to Induction with Higher-Order Encodings.	LPAR	2001	DBLP DOI BibTeX RDF
1	David McMath, Marianna Rozenfeld, Richard Sommer	A Computer Environment for Writing Ordinary Mathematical Proofs.	LPAR	2001	DBLP DOI BibTeX RDF
1	Rong Yang, Steve Gregory	Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Search.	LPAR	2001	DBLP DOI BibTeX RDF
1	Bijan Afshordel, Thomas Hillenbrand, Christoph Weidenbach	First-Order Atom Definitions Extended.	LPAR	2001	DBLP DOI BibTeX RDF
1	Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller	Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving.	LPAR	2001	DBLP DOI BibTeX RDF
1	Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev	Monodic fragments of first-order temporal logics: 2000-2001 A.D.	LPAR	2001	DBLP DOI BibTeX RDF
1	Salvador Lucas	Termination of Rewriting With Strategy Annotations.	LPAR	2001	DBLP DOI BibTeX RDF	Rewriting strategies, termination
1	Susana Muñoz-Hernández, Juan José Moreno-Navarro, Manuel V. Hermenegildo	Efficient Negation Using Abstract Interpretation.	LPAR	2001	DBLP DOI BibTeX RDF	Implementations of Logic Programming, Program Analysis, Abstract Interpretation, Constraint Logic Programming, Negation in Logic Programming
1	Ofer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe	Coherent Composition of Distributed Knowledge-Bases Through Abduction.	LPAR	2001	DBLP DOI BibTeX RDF
1	Hans de Nivelle	Splitting Through New Proposition Symbols.	LPAR	2001	DBLP DOI BibTeX RDF
1	Miyuki Koshimura, Hiroshi Fujita 0002, Ryuzo Hasegawa	Model Generation with Boolean Constraints.	LPAR	2001	DBLP DOI BibTeX RDF
1	Sylvain Boulmé, Grégoire Hamon	Certifying Synchrony for Free.	LPAR	2001	DBLP DOI BibTeX RDF
1	Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt	Computational Space Efficiency and Minimal Model Generation for Guarded Formulae.	LPAR	2001	DBLP DOI BibTeX RDF
1	Sebastian Sardiña	Local Conditional High-Level Robot Programs.	LPAR	2001	DBLP DOI BibTeX RDF
1	Raúl Monroy	Concept Formation via Proof Planning Failure.	LPAR	2001	DBLP DOI BibTeX RDF
1	Yong Luo 0001, Zhaohui Luo	Coherence and Transitivity in Coercive Subtyping.	LPAR	2001	DBLP DOI BibTeX RDF
1	Christopher Lynch, Barbara Morawska 0001	Complexity of Linear Standard Theories.	LPAR	2001	DBLP DOI BibTeX RDF
1	Robert Nieuwenhuis, Andrei Voronkov (eds.)	Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings	LPAR	2001	DBLP DOI BibTeX RDF
1	Samir Genaim, Michael Codish	Inferring Termination Conditions for Logic Programs Using Backwards Analysis.	LPAR	2001	DBLP DOI BibTeX RDF
1	Cristina Borralleras, Albert Rubio	A Monotonic Higher-Order Semantic Path Ordering.	LPAR	2001	DBLP DOI BibTeX RDF
1	Robert Baumgartner, Sergio Flesca, Georg Gottlob	The Elog Web Extraction Language.	LPAR	2001	DBLP DOI BibTeX RDF
1	Dietmar Berwanger, Erich Grädel	Games and Model Checking for Guarded Logics.	LPAR	2001	DBLP DOI BibTeX RDF
1	Alexander Serebrenik, Danny De Schreye	Inference of Termination Conditions for Numerical Loops in Prolog.	LPAR	2001	DBLP DOI BibTeX RDF
1	Stephan Kreutzer	Operational Semantics for Fixed-Point Logics on Constraint Databases.	LPAR	2001	DBLP DOI BibTeX RDF
1	Kai Engelhardt, Ron van der Meyden, Yoram Moses	A Refinement Theory that Supports Reasoning About Knowledge and Time.	LPAR	2001	DBLP DOI BibTeX RDF
1	Joseph D. Horton	Counting the Number of Equivalent Binary Resolution Proofs.	LPAR	2001	DBLP DOI BibTeX RDF
1	Orna Kupferman, Moshe Y. Vardi	On Bounded Specifications.	LPAR	2001	DBLP DOI BibTeX RDF
1	Reinhold Letz, Gernot Stenz	Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux.	LPAR	2001	DBLP DOI BibTeX RDF
1	Daniel Leivant	The Functions Provable by First Order Abstraction.	LPAR	2001	DBLP DOI BibTeX RDF
1	Alvaro del Val	Simplifying Binary Propositional Theories into Connected Components Twice as Fast.	LPAR	2001	DBLP DOI BibTeX RDF
1	Franz Baader, Ralf Küsters	Unification in a Description Logic with Transitive Closure of Roles.	LPAR	2001	DBLP DOI BibTeX RDF
1	Francisco Javier López-Fraguas, Jaime Sánchez-Hernández	Functional Logic Programming with Failure: A Set-Oriented View.	LPAR	2001	DBLP DOI BibTeX RDF
1	Gianluca Amato, James Lipton	Indexed Categories and Bottom-Up Semantics of Logic Programs.	LPAR	2001	DBLP DOI BibTeX RDF
1	Thomas Eiter, Michael Fink 0001, Giuliana Sabbatini, Hans Tompits	Reasoning about Evolving Nonmonotonic Knowledge Bases.	LPAR	2001	DBLP DOI BibTeX RDF
1	Natasha Alechina, Brian Logan 0001	Logical Omniscience and the Cost of Deliberation.	LPAR	2001	DBLP DOI BibTeX RDF
1	Enrico Franconi, Antonio Laureti Palma, Nicola Leone, Simona Perri, Francesco Scarcello	Census Data Repair: a Challenging Application of Disjunctive Logic Programming.	LPAR	2001	DBLP DOI BibTeX RDF
1	Guy Perrier	Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions.	LPAR	2001	DBLP DOI BibTeX RDF
1	Thomas Marthedal Rasmussen	Automated Proof Support for Interval Logics.	LPAR	2001	DBLP DOI BibTeX RDF
1	Toby Walsh	Permutation Problems and Channelling Constraints.	LPAR	2001	DBLP DOI BibTeX RDF
1	Alexander Serebrenik, Danny De Schreye	On Termination of Meta-Programs.	LPAR	2001	DBLP DOI BibTeX RDF
1	Klaus Schneider 0001	Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy.	LPAR	2001	DBLP DOI BibTeX RDF
1	Wim Vanhoof, Maurice Bruynooghe	Binding-Time Annotations Without Binding-Time Analysis.	LPAR	2001	DBLP DOI BibTeX RDF
1	Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill	Boolean Functions for Finite-Tree Dependencies.	LPAR	2001	DBLP DOI BibTeX RDF
1	Jan-Georg Smaus	Analysis of Polymorphically Typed Logic Programs Using ACI-Unification.	LPAR	2001	DBLP DOI BibTeX RDF
1	Christian G. Fermüller, Georg Moser, Richard Zach	Tableaux for Reasoning About Atomic Updates.	LPAR	2001	DBLP DOI BibTeX RDF
1	Jussi Rintanen	Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae.	LPAR	2001	DBLP DOI BibTeX RDF
1	Andreas Behrend	Efficient Computation of the Well-Founded Model Using Update Propagation.	LPAR	2001	DBLP DOI BibTeX RDF
1	Volker Diekert, Paul Gastin	Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.	LPAR	2001	DBLP DOI BibTeX RDF	concurrency, Temporal logics, Mazurkiewicz traces
1	Marco Comini, Roberta Gori, Giorgio Levi	How to Transform an Analyzer into a Verifier.	LPAR	2001	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron	Compiling and Verifying Security Protocols.	LPAR	2000	DBLP DOI BibTeX RDF
1	Cécile Canovas-Dumas, Paul Caspi	A PVS Proof Obligation Generator for Lustre Programs.	LPAR	2000	DBLP DOI BibTeX RDF
1	Richard Statman	Church's Lambda Delta Calculus.	LPAR	2000	DBLP DOI BibTeX RDF
1	Elvira Albert, Michael Hanus, Germán Vidal	Using an Abstract Representation to Specialize Functional Logic Programs.	LPAR	2000	DBLP DOI BibTeX RDF
1	Jean-Vincent Loddo, Roberto Di Cosmo	Playing Logic Programs with the Alpha-Beta Algorithm.	LPAR	2000	DBLP DOI BibTeX RDF
1	Erich Grädel	Efficient Evaluation Methods for Guarded Logics and Datalog LITE.	LPAR	2000	DBLP DOI BibTeX RDF
1	Sergio Greco, Ester Zumpano	Querying Inconsistent Databases.	LPAR	2000	DBLP DOI BibTeX RDF
1	Christian G. Fermüller, Georg Moser	Have Spass with OCC1Ng=.	LPAR	2000	DBLP DOI BibTeX RDF
1	Steffen Hölldobler, Dietrich Kuske	The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus.	LPAR	2000	DBLP DOI BibTeX RDF

Publications at "LPAR"( http://dblp.L3S.de/Venues/LPAR )