The following pages link to Agostino Dovier (Q206864):
Displaying 50 items.
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Disunification in ACI1 theories (Q704658) (← links)
- Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case (Q1290508) (← links)
- Operational and abstract semantics of the query language G-Log (Q1607222) (← links)
- (Q1749226) (redirect page) (← links)
- Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- BAAC: A Prolog System for Action Description and Agents Coordination (Q2909158) (← links)
- Perspectives on Logic-Based Approaches for Reasoning about Actions and Change (Q3001924) (← links)
- An Investigation of Multi-Agent Planning in CLP (Q3084981) (← links)
- {log}: A language for programming in logic with finite sets (Q3129506) (← links)
- A Theoretical Perspective of Coinductive Logic Programming (Q3187007) (← links)
- GASP: Answer Set Programming with Lazy Grounding (Q3400569) (← links)
- Set unification (Q3422416) (← links)
- Multivalued action languages with constraints in CLP(FD) (Q3550913) (← links)
- CLP-based protein fragment assembly (Q3585180) (← links)
- Multivalued Action Languages with Constraints in CLP(FD) (Q3608659) (← 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)
- (Q4259955) (← links)
- (Q4264105) (← links)
- (Q4281605) (← links)
- (Q4385450) (← links)
- (Q4474008) (← links)
- (Q4506398) (← links)
- (Q4518875) (← links)
- (Q4551136) (← links)
- Planning as tabled logic programming (Q4592996) (← links)
- (Q4631183) (← links)
- Extending Logic Programming with Labelled Variables: Model and Semantics (Q4686514) (← links)
- (Q4787351) (← links)
- Rank-Based Symbolic Bisimulation (Q4916208) (← links)
- Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta. (Q4923520) (← links)
- (Q4939254) (← links)
- (Q4940937) (← links)
- (Q4944864) (← links)
- (Q5087786) (← links)
- Modelling Multi-Agent Epistemic Planning in ASP (Q5140002) (← links)
- Logic Programming (Q5191486) (← links)
- Constrained Community-Based Gene Regulatory Network Inference (Q5270735) (← links)
- Decidability results for sets with atoms (Q5277749) (← links)
- A uniform approach to constraint-solving for lists, multisets, compact lists, and sets (Q5277804) (← links)
- Autonomous agents coordination: Action languages meet CLP() and Linda (Q5299582) (← links)
- A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem (Q5387829) (← links)
- Agent-based protein structure prediction (Q5424342) (← links)
- Logic Programming (Q5475770) (← links)
- (Q5714250) (← links)
- <tt>3coSoKu</tt> and its declarative modeling (Q5862472) (← links)
- Recent Advances in Constraints (Q5901718) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)
