On propositional definability

Authors:
Jérôme Lang;Pierre Marquis
Affiliations:
IRIT, CNRS / Université Paul Sabatier, 118 route de Narbonne, 31062 Toulouse, France;CRIL, CNRS / Université d'Artois, rue Jean Souvraz, S.P. 18, 62307 Lens, France
Venue:
Artificial Intelligence
Year:
2008

Citing 32
Cited 5

Probabilistic logic

Artificial Intelligence
Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A theory of diagnosis from first principles

Artificial Intelligence
Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic

AUSCRYPT '90 Proceedings of the international conference on cryptology on Algebraic logic and universal algebra in computer science
Frames in the space of situations (research note)

Artificial Intelligence
Reducing BDD size by exploiting functional dependencies

DAC '93 Proceedings of the 30th international Design Automation Conference
Recognition of q-Horn formulae in linear time

Discrete Applied Mathematics
An action language based on causal explanation: preliminary report

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Functional dependencies in Horn theories

Artificial Intelligence
Renaming a Set of Clauses as a Horn Set

Journal of the ACM (JACM)
On strongest neccessary and weakest sufficient conditions

Artificial Intelligence
On functional dependencies in q-Horn theories

Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems
Decomposable negation normal form

Journal of the ACM (JACM)
Conditional independence in propositional logic

Artificial Intelligence
Inferring Minimal Functional Dependencies in Horn and q-Horn Theories

Annals of Mathematics and Artificial Intelligence
Compiling Knowledge into Decomposable Negation Normal Form

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Dependent and Independent Variables in Propositional Satisfiability

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Computation of Prime Implicates and Prime Implicants by a variant of the Davis and Putnam Procedure

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Basic description logics

The description logic handbook
Views and queries: determinacy and rewriting

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Binary Decision Diagrams

IEEE Transactions on Computers
On the use of partially ordered decision graphs for knowledge compilation and quantified Boolean formulae

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Propositional fragments for knowledge compilation and quantified boolean formulae

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
A knowledge compilation map

Journal of Artificial Intelligence Research
A logical account of relevance

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Causal theories of action: a computational core

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A perspective on knowledge compilation

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Functional dependencies in a relational database and propositional logic

IBM Journal of Research and Development
Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics

Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics
Automatic extraction of functional dependencies

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Lost in translation: language independence in propositional logic-application to belief revision and belief merging

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Beth definability in expressive description logics

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Supporting multiple perspectives in feature-based configuration

Software and Systems Modeling (SoSyM)
Lost in translation: Language independence in propositional logic - application to belief change

Artificial Intelligence
Beth definability in expressive description logics

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In standard propositional logic, logical definability is the ability to derive the truth value of some propositional symbols given a propositional formula and the truth values of some propositional symbols. Although appearing more or less informally in various AI settings, a computation-oriented investigation of the notion is still lacking, and this paper aims at filling the gap. After recalling the two definitions of definability, which are equivalent in standard propositional logic (while based on different intuitions), and defining a number of related notions, we give several characterization results, and many complexity results for definability. We also show close connections with hypothesis discriminability and with reasoning about action and change.