Heterogeneous active agents. III: Polynomially implementable agents
From MaRDI portal
Recommendations
Cites work
- Characterizations of the disjunctive stable semantics by partial evaluation
- Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
- Computing the well-founded semantics faster
- Formal theories of knowledge in AI and robotics
- From logic programming towards multi-agent systems
- Heterogeneous active agents, I: Semantics
- Heterogeneous active agents, II: Algorithms and complexity
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 534879 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Linear unification
- Nonmonotonic reasoning: Towards efficient calculi and implementations
- Reasoning with logic programming
Cited in
(6)- Systems of agents controlled by logical programs: complexity of verification
- Heterogeneous active agents, I: Semantics
- Heterogeneous active agents, II: Algorithms and complexity
- scientific article; zbMATH DE number 7453147 (Why is no real title available?)
- Heterogeneous temporal probabilistic agents
- Temporal agent programs
This page was built for publication: Heterogeneous active agents. III: Polynomially implementable agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978315)