default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFundamenta Informaticae, Volume 39
Volume 39, Numbers 1-2, July 1999
- Clemens Ballarin, Lawrence C. Paulson:
A Pragmatic Approach to Extending Provers by Computer Algebra - with Applications to Coding Theory. 1-20 - Belaid Benhamou, Laurent Henocque:
A Hybrid Method for Finite Model Search in Equational Theories. 21-38 - Piergiorgio Bertoli, Jacques Calmet, Fausto Giunchiglia, Karsten Homann:
Specification and Integration of Theorem Provers and Computer Algebra Systems. 39-57 - Uwe Egly, Stephan Schmitt:
On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis. 59-83 - Stéphane Fèvre, Dongming Wang:
Combining Clifford Algebraic Computing and Term-Rewriting for Geometric Theorem Proving. 85-104 - Melvin Fitting:
On Quantified Modal Logic. 105-121 - Dirk Fuchs:
On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi. 123-143 - Christopher Lynch, Christelle Scharff:
Basic Completion with E-cycle Simplification. 145-165 - Éric Monfroy, Christophe Ringeissen:
An Open Automated Framework for Constraint Solver Extension: the SoleX Approach. 167-187 - Brigitte Pientka, Christoph Kreitz:
Automating Inductive Specification Proofs. 189-209 - J. Rafael Sendra, Franz Winkler:
Algorithms for Rational Real Algebraic Curves. 211-228
Volume 39, Number 3, July-August 1999
- Ivo Düntsch, Hui Wang, Stephen McCloskey:
Relations Algebras in Qualitative Spatial Reasoning. 229-248 - Sergey M. Dudakov
:
On the Complexity of Perfect Models of Logic Programs. 249-258 - Bernhard Heinemann:
The Complexity of Certain Modal Formulas on Binary Ramified Subset Trees. 259-272 - Benedetto Intrigila, Paola Inverardi, Marisa Venturini Zilli:
A Comprehensive Setting for Matching and Unification over Iterative Terms. 273-304 - Teodor Knapik, Hugues Calbrix:
Thue Specifications and Their Monadic Second-order Properties. 305-325 - Heike Müller, Torsten Hilbrich, Ralf Kühnel:
An Assistant Agent. 327-336
Volume 39, Number 4, September 1999
- Igor Chikalov:
On Average Time Complexity of Decision Trees and Branching Programs. 337-357 - Piotr Ejdys, Grzegorz Góra:
The More We Learn the Less We Know? On Inductive Learning from Examples. 359-374 - Jurriaan Hage:
The Membership Problem for Switching Classes with Skew Gains. 375-387 - V. Wiktor Marek, Miroslaw Truszczynski:
Contributions to the Theory of Rough Sets. 389-409 - Frank Wolter, Michael Zakharyaschev:
Modal Description Logics: Modalizing Roles. 411-438
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.
last updated on 2024-12-22 19:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
