The following pages link to Fundamenta Informaticae (Q2803574):
Displaying 50 items.
- Probabilistic timed automata with clock-dependent probabilities (Q1685793) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
- Deriving and retrieving contextual categorical information through instance inheritance (Q2708312) (← links)
- Conditional concatenation (Q2708313) (← links)
- Computational complexity of multimodal logics based on rough sets (Q2708314) (← links)
- Representability of pairing relation algebras depends on your ontology (Q2708315) (← links)
- Elementary complexity and geometry of interaction (Q2708316) (← links)
- Counting a type's (principal) inhabitants (Q2708317) (← links)
- Computing with Böhm trees (Q2708318) (← links)
- Explicit environments (Q2708319) (← links)
- Marginalia to a theorem of Jacopini (Q2708320) (← links)
- Strong normalisation of cut-elimination in classical logic (Q2708321) (← links)
- Iteration-free PDL with intersection: A complete axiomatization (Q2711323) (← links)
- From Mirkin's prebases to Antimirov's word partial derivatives (Q2711324) (← links)
- Complexity of fuzzy probability logics (Q2711325) (← links)
- Decomposing timed push down automata (Q2711326) (← links)
- Uniform generation of languages by scattered context grammars (Q2711327) (← links)
- Skeptical reasoning in FC-normal logic programs is \(\Pi_1^1\)-complete (Q2711328) (← links)
- Approximating a shortest watchman route (Q2711329) (← links)
- Sup-compact and inf-compact representations of \(W\)-operators (Q2729664) (← links)
- Sensitivity analysis for selective learning by feedforward neural networks (Q2729665) (← links)
- Valences in Lindenmayer systems (Q2729666) (← links)
- Process algebras for network communication (Q2729667) (← links)
- Nonmodularity results for lambda calculus (Q2729668) (← links)
- Complexity results for 2CNF default theories (Q2729669) (← links)
- Qualitative spatial representation and reasoning: An overview (Q2729670) (← links)
- Continuous shape transformation and metrics on regions (Q2729671) (← links)
- Dominance diagrams: A tool for qualitative reasoning about continuous systems (Q2729672) (← links)
- Algebras of approximating regions (Q2729673) (← links)
- On connection synthesis via rough mereology (Q2729674) (← links)
- The qualitative structure of built environments (Q2729675) (← links)
- Points in point-free mereotopology (Q2729676) (← links)
- A categorical axiomatisation of region-based geometry (Q2729677) (← links)
- Empiricism and rationalism in region-based theories of space (Q2729678) (← links)
- Special issue: Qualitative spatial reasoning (Q2729679) (← links)
- A method for hierarchical description of images using multiscale analysis (Q2730038) (← links)
- TBase2 -- a web-based electronic patient record (Q2730136) (← links)
- A fragment of intuitionistic dynamic logic (Q2730719) (← links)
- A possibilistic decision logic with applications (Q2730720) (← links)
- Sensitivity analysis for selective learning by feedforward neural networks (Q2730721) (← links)
- A note on SE-systems and regular canonical systems (Q2730722) (← links)
- Algorithms and reductions for rewriting problems (Q2730723) (← links)
- The ground tree transducer game with identical tree automata (Q2753653) (← links)
- On different models for packet flow in multistage interconnection networks (Q2762270) (← links)
- The modal query language MDatalog (Q2762271) (← links)
- Prelanguages versus submonoids (Q2762273) (← links)
- Geodesy and connectivity in lattices (Q2762274) (← links)
- Reduction and a simple proof of characterization of fuzzy concept lattices (Q2762275) (← links)
- Special issue: CS \& P 2000 workshop. Papers from the meeting on concurrency, specification and programming, Berlin, Germany, October 9--11, 2000 (Q2775856) (← links)
