Marco Cadoli

According to our database1, Marco Cadoli authored at least 69 papers between 1990 and 2009.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2009
Generalizing consistency and other constraint properties to quantified constraints.
ACM Trans. Comput. Log., 2009

2008
A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability.
J. Artif. Intell. Res., 2008

Evaluating ASP and Commercial Solvers on the CSPLib.
Constraints, 2008

2007
Combining relational algebra, SQL, constraint modelling, and local search.
TPLP, 2007

Exploiting functional dependencies in declarative problem specifications.
Artif. Intell., 2007

Finite Model Reasoning on UML Class Diagrams Via Constraint Programming.
Proceedings of the AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 2007

2006
k-Approximating Circuits.
IEEE Trans. Computers, 2006

Evaluating ASP and commercial solvers on the CSPLib (Preliminary work).
Proceedings of the 20th Workshop on Logic Programming, 2006

SAT as an Effective Solving Technology for Constraint Problems.
Proceedings of the Foundations of Intelligent Systems, 16th International Symposium, 2006

Evaluating ASP and Commercial Solvers on the CSPLib.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

On the Separability of Subproblems in Benders Decompositions.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

Partial Solutions with Unique Completion.
Proceedings of the Reasoning, 2006

2005
Complexity of propositional nested circumscription and nested abnormality theories.
ACM Trans. Comput. Log., 2005

: Compiling problem specifications into SAT.
Artif. Intell., 2005

Detecting and Breaking Symmetries by Reasoning on Problem Specifications.
Proceedings of the Abstraction, 2005

Using a Theorem Prover for Reasoning on Constraint Problems.
Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

CSP Properties for Quantified Constraints: Definitions and Complexity.
Proceedings of the Proceedings, 2005

2004
Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems.
Proceedings of the Logic for Programming, 2004

Automated Reformulation of Specifications by Safe Delay of Constraints.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Exploiting Functional Dependencies in Declarative Problem Specifications.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Towards Implementing Finite Model Reasoning in Description Logics.
Proceedings of the 2004 International Workshop on Description Logics (DL2004), 2004

2003
Proposal-Based Negotiation in Convex Regions.
Proceedings of the Cooperative Information Agents VII, 7th International Workshop, 2003

Towards automated reformulation of specications.
Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

2002
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation.
J. Autom. Reasoning, 2002

Preprocessing of Intractable Problems.
Inf. Comput., 2002

k-Approximating Circuits
Electronic Colloquium on Computational Complexity (ECCC), 2002

Knowledge Compilation = Query Rewriting + View Synthesis.
Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

Combining Relational Algebra, SQL, and Constraint Programming.
Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

2001
Complexity of Nested Circumscription and Abnormality Theories.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Compiling Problem Specifications into SAT.
Proceedings of the Programming Languages and Systems, 2001

The Expressive Power of Binary Linear Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
LOCAL++: A C++ framework for local search algorithms.
Softw., Pract. Exper., 2000

Space Efficiency of Propositional Knowledge Representation Formalisms.
J. Artif. Intell. Res., 2000

NP-SPEC: an executable specification language for solving all problems in NP.
Comput. Lang., 2000

Semantical and computational aspects of Horn approximations.
Artif. Intell., 2000

1999
Propositional lower bounds: Algorithms and complexity.
Ann. Math. Artif. Intell., 1999

LOCAL++: A C++ Framework for Local Search Algorithms.
Proceedings of the TOOLS Europe 1999: 29th International Conference on Technology of Object-Oriented Languages and Systems, 1999

NP-SPEC: An Executable Specification Language for Solving All Problems in NP.
Proceedings of the Practical Aspects of Declarative Languages, 1999

Using LPNMR for Problem Specification and Code Generation.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

1998
Circumscribing DATALOG: Expressive Power and Complexity.
Theor. Comput. Sci., 1998

Using Abstract Resources to Control Reasoning.
Journal of Logic, Language and Information, 1998

Propositional Lower Bounds: Generalization and Algorithms.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

An Algorithm to Evaluate Quantified Boolean Formulae.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
On Compact Representations of Propositional Circumscription.
Theor. Comput. Sci., 1997

A Survey on Knowledge Compilation.
AI Commun., 1997

Datalog and Description Logics: Expressive Power.
Proceedings of the Database Programming Languages, 6th International Workshop, 1997

Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae.
Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

Datalog and Description Logics: Expressive Power.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
On the complexity of Entailment in Propositional Multivalued Logics.
Ann. Math. Artif. Intell., 1996

Is Intractability of Nonmonotonic Reasoning a Real Drawback?
Artif. Intell., 1996

Comparing Space Efficiency of Propositional Knowledge Representation Formalisms.
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Feasibility and Unfeasibility of Off-Line Processing.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Datalog and Description Logics: Expressive Power - Preliminary Report.
Proceedings of the 1996 International Workshop on Description Logics, 1996

1995
Tractable Reasoning via Approximation.
Artif. Intell., 1995

On Compact Representations of Propositional Circumscription.
STACS, 1995

The Size of a Revised Knowledge Base.
Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

Tractable Reasoning in Artificial Intelligence
Lecture Notes in Computer Science 941, Springer, ISBN: 3-540-60058-2, 1995

1994
The Complexity of Propositional Closed World Reasoning and Circumscription.
J. Comput. Syst. Sci., 1994

Default Logic as a Query Language.
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Is Intractability of Non-Monotonic Reasoning a Real Drawback?
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
A Survey of Complexity Results for Nonmonotonic Logics.
J. Log. Program., 1993

Semantical and Computational Aspects of Horn Approximations.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992
The Complexity of Model Checking for Circumscriptive Formulae.
Inf. Process. Lett., 1992

An Efficient Method for Eliminating Varying Predicates from a Circumscription.
Artif. Intell., 1992

Approximate Reasoning and Non-Omniscient Agents.
Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge, 1992

Approximation in Concept Description Languages.
Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR'92). Cambridge, 1992

Approximate Inference in Default Logic and Circumscription.
ECAI, 1992

1991
Approximate Entailment.
Proceedings of the Trends in Artificial Intelligence, 1991

1990
The Complexity of Closed World Reasoning and Circumscription.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990


  Loading...