Enrico Giunchiglia

Orcid: 0000-0001-5758-2556

Affiliations:
  • University of Genoa, Italy


According to our database1, Enrico Giunchiglia authored at least 116 papers between 1988 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Symbolic Numeric Planning with Patterns.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Causal Laws and Multi-Valued Fluents.
CoRR, 2023

Nice and Nasty Theory of Mind for Social and Antisocial Robots.
Proceedings of the 32nd IEEE International Conference on Robot and Human Interactive Communication, 2023

Optimal Planning with Expressive Action Languages as Constraint Optimization.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

A Simple Proof-Theoretic Characterization of Stable Models.
Proceedings of the the Italian Workshop on Planning and Scheduling, 2023

2021
Reasoning with Quantified Boolean Formulas.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

2020
Optimal Planning Modulo Theories.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2018
Translation-based approaches for solving disjunctive temporal problems with preferences.
Constraints An Int. J., 2018

2016
Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows.
Fundam. Informaticae, 2016

2015
Automatic Test-Pattern Generation for Grey-Box Programs.
Proceedings of the 10th IEEE/ACM International Workshop on Automation of Software Test, 2015

An Empirical Perspective on Ten Years of QBF Solving.
Proceedings of the 22nd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2015 (RCRA 2015) A workshop of the XIV International Conference of the Italian Association for Artificial Intelligence (AI*IA 2015), 2015

2013
Combining approaches for solving satisfiability problems with qualitative preferences.
AI Commun., 2013

Partially Grounded Planning as Quantified Boolean Formula.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Modeling and Reasoning about Business Processes under Authorization Constraints: A Planning-Based Approach.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints.
J. Comput. Syst. Sci., 2012

Planning as Quantified Boolean Formula.
Proceedings of the ECAI 2012, 2012

Algorithms for Solving Satisfiability Problems with Qualitative Preferences.
Proceedings of the Correct Reasoning, 2012

2011
Introducing Preferences in Planning as Satisfiability.
J. Log. Comput., 2011

Parallel QBF Solving with Advanced Knowledge Sharing.
Fundam. Informaticae, 2011

Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

2010
QuBE7.0.
J. Satisf. Boolean Model. Comput., 2010

Using Bounded Model Checking for Coverage Analysis of Safety-Critical Software in an Industrial Setting.
J. Autom. Reason., 2010

Solving satisfiability problems with preferences.
Constraints An Int. J., 2010

sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Automatic generation of high quality test sets via CBMC.
Proceedings of the 6th International Verification Workshop, 2010

2009
Reasoning with Quantified Boolean Formulas.
Proceedings of the Handbook of Satisfiability, 2009

Introduction to the special issue on quantified CSPs and QBF.
Constraints An Int. J., 2009

Formal Specification and Automatic Analysis of Business Processes under Authorization Constraints: An Action-Based Approach.
Proceedings of the Trust, 2009

PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Comparison of knowledge sharing strategies in a parallel QBF solver.
Proceedings of the 2009 International Conference on High Performance Computing & Simulation, 2009

Automatic Test Generation for Coverage Analysis of ERTMS Software.
Proceedings of the Second International Conference on Software Testing Verification and Validation, 2009

Automatic Test Generation for Coverage Analysis Using CBMC.
Proceedings of the Computer Aided Systems Theory, 2009

Evaluation of Knowledge Sharing Strategies in a Parallel QBF Solver.
Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009

Improving Plan Quality in SAT-Based Planning.
Proceedings of the AI*IA 2009: Emergent Perspectives in Artificial Intelligence, 2009

Improving the Automatic Test Generation process for Coverage Analysis using CBMC.
Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009

2008
On the relation among answer set solvers.
Ann. Math. Artif. Intell., 2008

Preprocessing Techniques for QBFs.
Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008

A new Approach for Solving Satisfiability Problems with Qualitative Preferences.
Proceedings of the ECAI 2008, 2008

Computing All Optimal Solutions in Satisfiability Problems with Preferences.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
Quantifier Structure in Search-Based Procedures for QBFs.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007

SAT-Based Planning with Minimal-#actions Plans and "soft" Goals.
Proceedings of the AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 2007

Planning as Satisfiability with Preferences.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Answer Set Programming Based on Propositional Satisfiability.
J. Autom. Reason., 2006

Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas.
J. Artif. Intell. Res., 2006

Logics For Artificial Intelligence.
Intelligenza Artificiale, 2006

optsat: A Tool for Solving SAT Related Optimization Problems.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

Solving Optimization Problems with DLL.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005
Satisfiability in the Year 2005.
J. Autom. Reason., 2005

The SAT-based Approach to Separation Logic.
J. Autom. Reason., 2005

Constraints and AI Planning.
IEEE Intell. Syst., 2005

On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels).
Proceedings of the Logic Programming, 21st International Conference, 2005

Efficient Semantic Matching.
Proceedings of the Semantic Web: Research and Applications, 2005

SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective.
Proceedings of the Mechanizing Mathematical Reasoning, 2005

An Experimental Study of Search Strategies and Heuristics in Answer Set Programming.
Proceedings of the Answer Set Programming, 2005

Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming.
Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2004
TSAT++: an Open Platform for Satisfiability Modulo Theories.
Proceedings of the Selected Papers from the Workshops on Disproving, 2004

The 2003 International Conference on Automated Planning and Scheduling (ICAPS-03).
AI Mag., 2004

Nonmonotonic causal theories.
Artif. Intell., 2004

Editorial: Nonmonotonic Reasoning.
Artif. Intell., 2004

QBF Reasoning on Real-World Instances.
Proceedings of the SAT 2004, 2004

A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints.
Proceedings of the SAT 2004, 2004

A SAT-based polynomial space algorithm for answer set programming.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

QuBE++: An Efficient QBF Solver.
Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

Monotone Literals and Learning in QBF Reasoning.
Proceedings of the Principles and Practice of Constraint Programming, 2004

SAT-Based Answer Set Programming.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Backjumping for Quantified Boolean Logic satisfiability.
Artif. Intell., 2003

SAT-based planning in complex domains: Concurrency, constraints and nondeterminism.
Artif. Intell., 2003

Watched Data Structures for QBF Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
SAT-Based Decision Procedures for Classical Modal Logics.
J. Autom. Reason., 2002

Dependent and Independent Variables in Propositional Satisfiability.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

Integrating BDD-Based and SAT-Based Symbolic Model Checking.
Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

NuSMV 2: An OpenSource Tool for Symbolic Model Checking.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

Learning for Quantified Boolean Logic Satisfiability.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Ideal and Real Belief about Belief.
J. Log. Comput., 2001

Towards an Efficient Library for SAT: a Manifesto.
Electron. Notes Discret. Math., 2001

A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics.
Ann. Math. Artif. Intell., 2001

Benefits of Bounded Model Checking at an Industrial Setting.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability.
Proceedings of the AI*IA 2001: Advances in Artificial Intelligence, 2001

2000
SAT vs. translation based decision procedures for modal logics: a comparative evaluation.
J. Appl. Non Class. Logics, 2000

A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism.
Proceedings of the KR 2000, 2000

System Description: *SAT: A Platform for the Development of Modal Decision Procedures.
Proceedings of the Automated Deduction, 2000

Planning as Satisfiability in Nondeterministic Domains.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Formal specification of beliefs in multi-agent systems.
Int. J. Intell. Syst., 1999

SAT-Based Procedures for Temporal Reasoning.
Proceedings of the Recent Advances in AI Planning, 5th European Conference on Planning, 1999

*SAT, KSATC, DLP and TA: a comparative analysis.
Proceedings of the 1999 International Workshop on Description Logics (DL'99), Linköping, Sweden, July 30, 1999

Applying the Davis-Putnam Procedure to Non-clausal Formulas.
Proceedings of the AI*IA 99:Advances in Artificial Intelligence, 1999

The SAT-Based Approach for Classical Modal Logics.
Proceedings of the AI*IA 99:Advances in Artificial Intelligence, 1999

1998
More Evaluation of Decision Procedures for Modal Logics.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

Planning via Model Checking in Deterministic Domains: Preliminary Report.
Proceedings of the Artificial Intelligence: Methodology, 1998

Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

An Action Language Based on Causal Explanation: Preliminary Report.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Representing Action: Indeterminacy and Ramifications.
Artif. Intell., 1997

Planning via Model Checking: A Decision Procedure for <i>AR</i>.
Proceedings of the Recent Advances in AI Planning, 4th European Conference on Planning, 1997

1996
Visual representation of natural language scene descriptions.
IEEE Trans. Syst. Man Cybern. Part B, 1996

Dealing with expected and unexpected obstacles.
J. Exp. Theor. Artif. Intell., 1996

Ideal and Real Belief aobout Belief: Some Intuitions.
Proceedings of the Agents Breaking Away, 1996

Determining Ramifications in the Situation Calculus.
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Formal Specification of Beliefs in Multi-Agent Systems.
Proceedings of the Intelligent Agents III, 1996

1995
A multicontext architecture for formalizing complex reasoning.
Int. J. Intell. Syst., 1995

Structured Proof Procedures.
Ann. Math. Artif. Intell., 1995

Dependent Fluents.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Agents as Reasoners, Observers, or Arbitrary Believers.
Proceedings of the First International Conference on Multiagent Systems, 1995

Agents as Reasoners, Observers or Believers.
Proceedings of the Topics in Artificial Intelligence, 1995

1994
MRG: Building planers for real-world complex applications.
Appl. Artif. Intell., 1994

1993
Embedding Complex Decision Procedures Inside an Interactive Theorem Prover.
Ann. Math. Artif. Intell., 1993

Multi-Context Systems as a Tool to Model Temporal Evolution.
Proceedings of the Methodologies for Intelligent Systems, 7th International Symposium, 1993

Non-Omniscient Belief as Context-Based Resoning.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

Proving Formulas through Reduction to Decidable Classes.
Proceedings of the Advances in Artificial Intelligence, 1993

1992
A Knowledge Based System for Automatic 3D Scene.
Proceedings of the Artificial Intelligence V: Methodology, Systems, Applications, 1992

1991
A Set of Hierarchically Structured Decision Procedures for Some Subclasses of First Order Logic.
Proceedings of the Third Scandinavian Conference on Artificial Intelligence, 1991

1990
Reasoning About Time in Qualitative Modeling.
Proceedings of the Modelling the Innovation: Communications, 1990

1988
Building Complex Derived Inference Rules: A Decider for the Class of Prenex Universal-Existential Formulas.
Proceedings of the 8th European Conference on Artificial Intelligence, 1988


  Loading...