Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Propositional calculus

Known as: Sentence logic, Exportation in logic, Truth-functional propositional logic 
Propositional calculus (also called propositional logic, sentential calculus, sentential logic, or sometimes zeroth-order logic) is the branch of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Feature models are used to specify members of a product-line. Despite years of progress, contemporary tools often provide limited… Expand
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes… Expand
  • figure 5
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We describe a theory of authentication and a system that implements it. Our theory is based on the notion of principal and a… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1982
Highly Cited
1982
We define a propositional version of the Μ-calculus, and give an exponential-time decision procedure, small model property, and… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
It is the purpose of this note to show that the question of whether a given propositional formula is intuitionistically valid (in… Expand
Is this relevant?
Highly Cited
1977
Highly Cited
1977
The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem… Expand
  • figure 1
Is this relevant?
Highly Cited
1974
Highly Cited
1974
One of the most important open questions in the field of computational complexity is the question of whether there is a… Expand
Is this relevant?
Highly Cited
1963
Highly Cited
1963
Publisher Summary This chapter discusses semantical analysis of modal logic ii and non-normal modal propositional calculi. The… Expand
Is this relevant?