scientific article
From MaRDI portal
Publication:3999206
zbMath0825.68599MaRDI QIDQ3999206
No author found.
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Logic in artificial intelligence (68T27) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items (88)
Termination proofs of well-moded logic programs via conditional rewrite systems ⋮ Representations of algebraic domains and algebraic L-domains by information systems ⋮ On function spaces equipped with Isbell topology and Scott topology ⋮ Computational adequacy via ‘mixed’ inductive definitions ⋮ A complexity theory for feasible closure properties ⋮ A Cartesian closed category of domains with almost algebraic bases ⋮ Representation of FS-domains based on closure spaces ⋮ Generalised information systems capture L-domains ⋮ A note on coherence of dcpos ⋮ The first-order theory of one-step rewriting is undecidable ⋮ Computational adequacy of the FIX-logic ⋮ Semantic data modelling using linear logic ⋮ On completeness and cocompleteness in and around small categories ⋮ Unnamed Item ⋮ Petri nets, Horn programs, linear logic and vector games ⋮ Innovations in computational type theory using Nuprl ⋮ Nested semantics over finite trees are equationally hard ⋮ Current trends in geometric modeling and selected computational applications ⋮ Linear logic automata ⋮ Permutative rewriting and unification ⋮ Resolution-based approach to compatibility analysis of interacting automata ⋮ Programming in metric temporal logic ⋮ No NP problems averaging over ranking of distributions are harder ⋮ A note on ``Extensional PERs ⋮ Avoiding slack variables in the solving of linear diophantine equations and inequations ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ Deciding safety and liveness in TPTL ⋮ The tail-recursive fragment of timed recursive CTL ⋮ Unique parallel decomposition in branching and weak bisimulation semantics ⋮ A representation of L-domains by information systems ⋮ Modal transition system encoding of featured transition systems ⋮ Generalized abstraction-refinement for game-based CTL lifted model checking ⋮ An exper model for Quest ⋮ A wide-spectrum language for object-based development of real-time systems ⋮ Learning recursive functions: A survey ⋮ On finite alphabets and infinite bases ⋮ Recursive definitions and fixed-points on well-founded structures ⋮ Tree automata for rewrite strategies ⋮ Domain-theoretical models of parametric polymorphism ⋮ Metric temporal logic with durations ⋮ Observational structures and their logic ⋮ On model checking multiple hybrid views ⋮ Information systems revisited -- the general continuous case ⋮ Two models of synthetic domain theory ⋮ New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic ⋮ Extensional PERs ⋮ Space-efficient path-reporting approximate distance oracles ⋮ Tail recursion through universal invariants ⋮ On stable domains ⋮ Incorporating quotation and evaluation into Church's type theory ⋮ 3-valued abstraction: More precision at less cost ⋮ Semantics of temporal constrained objects ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ Sobriety for equilogical spaces ⋮ Preface to the special volume ⋮ The fixed-point theory of strictly causal functions ⋮ Well rewrite orderings and well quasi-orderings ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ A Cartesian closed subcategory of \(\mathcal {CONT}\) which contains all continuous domains ⋮ On cool congruence formats for weak bisimulations ⋮ The probabilistic powerdomain for stably compact spaces ⋮ Grid structures and undecidable constraint theories ⋮ Synthesizing learners tolerating computable noisy data ⋮ Robust learning is rich ⋮ Recursive coalgebras from comonads ⋮ Axioms for real-time logics ⋮ What good are digital clocks? ⋮ Automating Soundness Proofs ⋮ Representation of bifinite domains by BF-closure spaces ⋮ The first-order theory of linear one-step rewriting is undecidable ⋮ A representation of FS-domains by formal concept analysis ⋮ Homogeneous probability measures on the Cantor set ⋮ Set constraints and automata ⋮ A computational method for inferring growth parameters and shape changes during development based on clonal analysis ⋮ Properly injective spaces and function spaces ⋮ Uniform approximation of topological spaces ⋮ Consistent-linear \textit{FS}-domains ⋮ The synthesis of language learners. ⋮ Basic theory of \(F\)-bounded quantification. ⋮ Games and full abstraction for FPC. ⋮ Full abstraction for PCF ⋮ Tarskian set constraints ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ Decision algorithms for multiplayer noncooperative games of incomplete information ⋮ All Cartesian closed categories of quasicontinuous domains consist of domains ⋮ Terminating non-disjoint combined unification
This page was built for publication:
