The following pages link to Cees Witteveen (Q361804):
Displaying 41 items.
- Program equilibrium -- a program reasoning approach (Q361805) (← links)
- Efficiently identifying deterministic real-time automata from labeled data (Q420918) (← links)
- The efficiency of identifying timed automata and the power of clocks (Q553334) (← links)
- (Q679243) (redirect page) (← links)
- A correct logic programming computation of default logic extensions (Q679244) (← links)
- Skeptical reason maintenance and belief revision (Q685347) (← links)
- Tableaux and sequent calculus for minimal entailment (Q688552) (← links)
- Recovery of (non)monotonic theories (Q1275600) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- Minimal belief and negation as failure (Q1342215) (← links)
- Nonmonotonic rule systems with recursive sets of restraints (Q1389245) (← links)
- Plan coordination by revision in collective agent based systems. (Q1852864) (← links)
- A resource logic for multi-agent plan merging (Q1861900) (← links)
- Completeness and incompleteness for plausibility logic (Q1923829) (← links)
- Stochastic task networks -- trading performance for stability (Q2011606) (← links)
- Dynamic temporal decoupling (Q2011608) (← links)
- Flexibility and decoupling in simple temporal networks (Q2014926) (← links)
- On a comparison of Newton-Raphson solvers for power flow problems (Q2315823) (← links)
- (Q2776473) (← links)
- Reconfiguration of Large-Scale Surveillance Systems (Q2851979) (← links)
- Push and Rotate: a Complete Multi-agent Pathfinding Algorithm (Q2929587) (← links)
- Plan decoupling of agents with qualitatively constrained tasks (Q3400461) (← links)
- Polynomial Distinguishability of Timed Automata (Q3528423) (← links)
- (Q3584251) (← links)
- A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data (Q3588378) (← links)
- Plan-Coordination Mechanisms and the Price of Autonomy (Q3602938) (← links)
- Fuzzy Argumentation for Trust (Q3602952) (← links)
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (Q3618628) (← links)
- Inferring control structures from the behaviour of a production system (Q3960145) (← links)
- (Q4028833) (← links)
- (Q4225125) (← links)
- (Q4244295) (← links)
- (Q4287520) (← links)
- (Q4395144) (← links)
- (Q4460679) (← links)
- (Q4537434) (← links)
- (Q4708237) (← links)
- (Q4738885) (← links)
- Revision by communication (Q5101450) (← links)
- Revising and updating using a back-up semantics (Q5236447) (← links)
- KI 2005: Advances in Artificial Intelligence (Q5897746) (← links)
