The following pages link to CCalc (Q21878):
Displaying 24 items.
- The Deontic Component of Action Language $n{\mathcal{C}}+$ (Q3529365) (← links)
- (Q3616094) (← links)
- A Probabilistic Extension of Action Language (Q4559817) (← links)
- Some properties of system descriptions of (Q4583309) (← links)
- Functional completion (Q4583310) (← links)
- Representing hybrid automata by action language modulo theories (Q4592716) (← links)
- Hybrid conditional planning using answer set programming (Q4592727) (← links)
- Modular action language (Q4593024) (← links)
- Deriving conclusions from non-monotonic cause-effect relations (Q4593049) (← links)
- Dynamic specification of open agent systems (Q4902309) (← links)
- Translating First-Order Causal Theories into Answer Set Programming (Q4930769) (← links)
- plasp 3: Towards Effective ASP Planning (Q4957186) (← links)
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + (Q4957223) (← links)
- Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language (Q5108524) (← links)
- Specifying norm-governed computational societies (Q5277819) (← links)
- Reasoning about actions with Temporal Answer Sets (Q5299584) (← links)
- Answer Set Programming for Representing and Reasoning About Virtual Institutions (Q5301996) (← links)
- Answer Set Programming for Single-Player Games in General Game Playing (Q5325764) (← links)
- Inductive Logic Programming (Q5394644) (← links)
- (Q5422266) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424864) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473971) (← links)
- Engineering an Incremental ASP Solver (Q5504656) (← links)
- (Q5701517) (← links)
