Enrico Giunchiglia

AI Commun., 2013

Partially Grounded Planning as Quantified Boolean Formula.

[BibT_eX]

[DOI]

Michael Cashmore

Maria Fox

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Planning as Quantified Boolean Formula.

[BibT_eX]

[DOI]

Michael Cashmore

Maria Fox

Proceedings of the ECAI 2012, 2012

Algorithms for Solving Satisfiability Problems with Qualitative Preferences.

[BibT_eX]

[DOI]

Proceedings of the Correct Reasoning, 2012

2011

Introducing Preferences in Planning as Satisfiability.

[BibT_eX]

[DOI]

J. Log. Comput., 2011

Parallel QBF Solving with Advanced Knowledge Sharing.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences.

[BibT_eX]

[DOI]

Barry O'Sullivan

Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

2010

QuBE7.0.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2010

Using Bounded Model Checking for Coverage Analysis of Safety-Critical Software in an Industrial Setting.

[BibT_eX]

[DOI]

J. Autom. Reason., 2010

Solving satisfiability problems with preferences.

[BibT_eX]

[DOI]

Constraints An Int. J., 2010

sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Automatic generation of high quality test sets via CBMC.

[BibT_eX]

[DOI]

Proceedings of the 6th International Verification Workshop, 2010

2009

Reasoning with Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Satisfiability, 2009

Introduction to the special issue on quantified CSPs and QBF.

[BibT_eX]

[DOI]

Kostas Stergiou

Constraints An Int. J., 2009

Formal Specification and Automatic Analysis of Business Processes under Authorization Constraints: An Action-Based Approach.

[BibT_eX]

[DOI]

Serena Elisa Ponta

Proceedings of the Trust, 2009

PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Comparison of knowledge sharing strategies in a parallel QBF solver.

[BibT_eX]

[DOI]

Proceedings of the 2009 International Conference on High Performance Computing & Simulation, 2009

Automatic Test Generation for Coverage Analysis of ERTMS Software.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Software Testing Verification and Validation, 2009

Automatic Test Generation for Coverage Analysis Using CBMC.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Systems Theory, 2009

Evaluation of Knowledge Sharing Strategies in a Parallel QBF Solver.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2009: Emergent Perspectives in Artificial Intelligence, 2009

Improving the Automatic Test Generation process for Coverage Analysis using CBMC.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Nicola Leone

Ann. Math. Artif. Intell., 2008

Preprocessing Techniques for QBFs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2008, 2008

Computing All Optimal Solutions in Satisfiability Problems with Preferences.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

2007

Quantifier Structure in Search-Based Procedures for QBFs.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007

SAT-Based Planning with Minimal-#actions Plans and "soft" Goals.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 2007

Planning as Satisfiability with Preferences.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Answer Set Programming Based on Propositional Satisfiability.

[BibT_eX]

[DOI]

Yuliya Lierler

J. Autom. Reason., 2006

Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2006

Logics For Artificial Intelligence.

[BibT_eX]

Luigia Carlucci Aiello

Luciano Serafini

Intelligenza Artificiale, 2006

optsat: A Tool for Solving SAT Related Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

Solving Optimization Problems with DLL.

[BibT_eX]

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005

Satisfiability in the Year 2005.

[BibT_eX]

[DOI]

Toby Walsh

J. Autom. Reason., 2005

The SAT-based Approach to Separation Logic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2005

Constraints and AI Planning.

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2005

On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels).

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 21st International Conference, 2005

Efficient Semantic Matching.

[BibT_eX]

[DOI]

Mikalai Yatskevich

Proceedings of the Semantic Web: Research and Applications, 2005

SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective.

[BibT_eX]

[DOI]

Proceedings of the Mechanizing Mathematical Reasoning, 2005

An Experimental Study of Search Strategies and Heuristics in Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Answer Set Programming, 2005

Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2004

TSAT++: an Open Platform for Satisfiability Modulo Theories.

[BibT_eX]

[DOI]

Proceedings of the Selected Papers from the Workshops on Disproving, 2004

The 2003 International Conference on Automated Planning and Scheduling (ICAPS-03).

[BibT_eX]

[DOI]

Nicola Muscettola

Dana S. Nau

AI Mag., 2004

Nonmonotonic causal theories.

[BibT_eX]

[DOI]

Artif. Intell., 2004

Editorial: Nonmonotonic Reasoning.

[BibT_eX]

[DOI]

Salem Benferhat

Artif. Intell., 2004

QBF Reasoning on Real-World Instances.

[BibT_eX]

[DOI]

Proceedings of the SAT 2004, 2004

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

[BibT_eX]

[DOI]

Proceedings of the SAT 2004, 2004

A SAT-based polynomial space algorithm for answer set programming.

[BibT_eX]

[DOI]

Yuliya Lierler

Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

QuBE++: An Efficient QBF Solver.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

Monotone Literals and Learning in QBF Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2004

SAT-Based Answer Set Programming.

[BibT_eX]

[DOI]

Yuliya Lierler

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Backjumping for Quantified Boolean Logic satisfiability.

[BibT_eX]

[DOI]

Artif. Intell., 2003

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

[BibT_eX]

[DOI]

Claudio Castellini

Artif. Intell., 2003

Watched Data Structures for QBF Solvers.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

SAT-Based Decision Procedures for Classical Modal Logics.

[BibT_eX]

[DOI]

J. Autom. Reason., 2002

Dependent and Independent Variables in Propositional Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

Integrating BDD-Based and SAT-Based Symbolic Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

NuSMV 2: An OpenSource Tool for Symbolic Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 14th International Conference, 2002

Learning for Quantified Boolean Logic Satisfiability.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Log. Comput., 2001

Towards an Efficient Library for SAT: a Manifesto.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2001

Benefits of Bounded Model Checking at an Industrial Setting.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 13th International Conference, 2001

QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2001: Advances in Artificial Intelligence, 2001

2000

SAT vs. translation based decision procedures for modal logics: a comparative evaluation.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2000

A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism.

[BibT_eX]

Proceedings of the KR 2000, 2000

System Description: *SAT: A Platform for the Development of Modal Decision Procedures.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2000

Planning as Satisfiability in Nondeterministic Domains.

[BibT_eX]

[DOI]

Paolo Ferraris

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.

[BibT_eX]

[DOI]

Int. J. Intell. Syst., 1999

SAT-Based Procedures for Temporal Reasoning.

[BibT_eX]

[DOI]

Claudio Castellini

Proceedings of the Recent Advances in AI Planning, 5th European Conference on Planning, 1999

*SAT, KSATC, DLP and TA: a comparative analysis.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Roberto Sebastiani

Proceedings of the AI*IA 99:Advances in Artificial Intelligence, 1999

The SAT-Based Approach for Classical Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 99:Advances in Artificial Intelligence, 1999

1998

More Evaluation of Decision Procedures for Modal Logics.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Mauro Di Manzo

Simone Ruffino

Proceedings of the Artificial Intelligence: Methodology, 1998

Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability.

[BibT_eX]

[DOI]

Alessandro Massarotto

Roberto Sebastiani

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.

[BibT_eX]

[DOI]

Vladimir Lifschitz

Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997

Representing Action: Indeterminacy and Ramifications.

[BibT_eX]

[DOI]

G. Neelakantan Kartha

Vladimir Lifschitz

Artif. Intell., 1997

Planning via Model Checking: A Decision Procedure for <i>AR</i>.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in AI Planning, 4th European Conference on Planning, 1997

1996

Visual representation of natural language scene descriptions.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Part B, 1996

Dealing with expected and unexpected obstacles.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1996

Ideal and Real Belief aobout Belief: Some Intuitions.

[BibT_eX]

[DOI]

Proceedings of the Agents Breaking Away, 1996

Determining Ramifications in the Situation Calculus.

[BibT_eX]

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Formal Specification of Beliefs in Multi-Agent Systems.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Agents III, 1996

1995

A multicontext architecture for formalizing complex reasoning.

[BibT_eX]

[DOI]

Paolo Traverso

Int. J. Intell. Syst., 1995

Structured Proof Procedures.

[BibT_eX]

[DOI]

Paolo Pecchiari

Ann. Math. Artif. Intell., 1995

Dependent Fluents.

[BibT_eX]

[DOI]

Vladimir Lifschitz

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

Agents as Reasoners, Observers, or Arbitrary Believers.

[BibT_eX]

Luciano Serafini

Proceedings of the First International Conference on Multiagent Systems, 1995

Agents as Reasoners, Observers or Believers.

[BibT_eX]

[DOI]

Luciano Serafini

Proceedings of the Topics in Artificial Intelligence, 1995

1994

MRG: Building planers for real-world complex applications.

[BibT_eX]

[DOI]

Appl. Artif. Intell., 1994

1993

Embedding Complex Decision Procedures Inside an Interactive Theorem Prover.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1993

Multi-Context Systems as a Tool to Model Temporal Evolution.

[BibT_eX]

[DOI]

Mauro Di Manzo

Proceedings of the Methodologies for Intelligent Systems, 7th International Symposium, 1993

Non-Omniscient Belief as Context-Based Resoning.

[BibT_eX]

[DOI]

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

Proving Formulas through Reduction to Decidable Classes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 1993

1992

A Knowledge Based System for Automatic 3D Scene.

[BibT_eX]

Paolo Traverso

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.

[BibT_eX]

Proceedings of the Third Scandinavian Conference on Artificial Intelligence, 1991

1990

Reasoning About Time in Qualitative Modeling.

[BibT_eX]

D. Tezza

Proceedings of the Modelling the Innovation: Communications, 1990

1988

Building Complex Derived Inference Rules: A Decider for the Class of Prenex Universal-Existential Formulas.

[BibT_eX]