The following pages link to Enrico Pontelli (Q206865):
Displayed 50 items.
- Item:Q206865 (redirect page) (← links)
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Disunification in ACI1 theories (Q704658) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- A generic approach to planning in the presence of incomplete information: theory and implementation (Q899156) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Parallel symbolic computation in ACE (Q1376096) (← links)
- Data structures for order-sensitive predicates in parallel nondeterministic systems (Q1581897) (← links)
- The temporal precedence problem (Q1587780) (← links)
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (Q1706596) (← links)
- A simple optimal solution for the temporal precedence problem on pure pointer machines (Q1764426) (← links)
- An optimal data structure to handle dynamic environments in non-deterministic computations (Q1869983) (← links)
- An action language for multi-agent domains (Q2060726) (← links)
- Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms (Q2433301) (← links)
- A new approach to hybrid probabilistic logic programs (Q2642628) (← links)
- State transition in multi-agent epistemic domains using answer set programming (Q2694576) (← links)
- (Q2751763) (← links)
- Optimization schemas for parallel implementation of non‐deterministic languages and systems (Q2758698) (← links)
- Reasoning about the Beliefs of Agents in Multi-agent Domains in the Presence of State Constraints: The Action Language mAL (Q2851977) (← links)
- Answer Set Programming and Planning with Knowledge and World-Altering Actions in Multiple Agent Domains (Q2900545) (← links)
- (Q2909158) (← links)
- (Q2909161) (← links)
- Implementing Reversible Processes in Multi-agent Action Languages Using Answer Set Planning (Q2915050) (← links)
- Finitary S5-Theories (Q2938497) (← links)
- Perspectives on Logic-Based Approaches for Reasoning about Actions and Change (Q3001924) (← links)
- Combining Answer Set Programming and Prolog: The $\mathbb{ASP{-}PROLOG}$ System (Q3001931) (← links)
- (Q3044332) (← links)
- An Optimal Algorithm for Finding NCA on Pure Pointer Machines (Q3046520) (← links)
- Planning for Multiagent Using ASP-Prolog (Q3055668) (← links)
- Reasoning about Multi-agent Domains Using Action Language $\mathcal{C}$ : A Preliminary Study (Q3055670) (← links)
- An Investigation of Multi-Agent Planning in CLP (Q3084981) (← links)
- {log}: A language for programming in logic with finite sets (Q3129506) (← links)
- Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures (Q3395270) (← links)
- GASP: Answer Set Programming with Lazy Grounding (Q3400569) (← links)
- Set unification (Q3422416) (← links)
- A Constructive semantic characterization of aggregates in answer set programming (Q3432855) (← links)
- Multivalued action languages with constraints in CLP(FD) (Q3550913) (← links)
- Logic programming for finding models in the logics of knowledge and its applications: A case study (Q3585176) (← links)
- CLP-based protein fragment assembly (Q3585180) (← links)
- Multivalued Action Languages with Constraints in CLP(FD) (Q3608659) (← links)
- Logic Programs with Abstract Constraint Atoms: The Role of Computations (Q3608661) (← links)
- Justifications for logic programs under answer set semantics (Q3612602) (← links)
- (Q3624081) (← links)
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems (Q3638568) (← links)
- Representing Multi-agent Planning in CLP (Q3643135) (← links)
- (Q4227005) (← links)
- (Q4281605) (← links)
- (Q4415095) (← links)