Results 241 to 250 of about 494,310 (275)

Conjunctive Grammars in Greibach Normal Form and the Lambek Calculus with Additive Connectives

Lecture Notes in Computer Science, 2013
We prove that any language without the empty word, generated by a conjunctive grammar in Greibach normal form, is generated by a grammar based on the Lambek calculus enriched with additive (“intersection” and “union”) connectives.
Stepán Kuznetsov
exaly   +3 more sources

Conjunctive Normal Form

, 2012
semanticscholar   +3 more sources

Reconstruction of Boolean Formulas in Conjunctive Normal Form

International Computing and Combinatorics Conference, 2018
A long-standing open problem in graph theory is to prove or disprove the graph reconstruction conjecture proposed by Kelly and Ulam in the 1940s. This conjecture roughly states that every graph on at least three vertices is uniquely determined by its vertex-deleted subgraphs.
Evgeny Dantsin, Alexander Wolpert
openaire   +2 more sources

Belief revision between conjunctive normal forms

Journal of Intelligent & Fuzzy Systems, 2018
Let K be a knowledge base (KB) and let φ be new information, both propositional formulas expressed in conjunctive form (CF). We propose a deterministic and correct algorithm for performing the belief revision of φ
Guillermo De Ita Luna, José Raymundo Marcial-Romero, Pedro Bello 0001, Meliza Contreras   +3 more
openaire   +2 more sources

A conjunctive normal form for S3.5

Journal of Symbolic Logic, 1969
In this note we sketch a decision procedure for S3.51 based on reduction to conjunctive normal form. Using the following theorem of S3.5: and its dual for M over a conjunction, any formula can be reduced by standard methods (as in S52) to a ...
M. Cresswell
openaire   +2 more sources

An Optimized Transformation into Conjunctive (or Disjunctive) Normal Form [PDF]

, 1987
Resolution based theorem proving systems require the conversion of predicate logic formulae into clausal normal form. One step of all procedures performing this transformation is the multiplication into conjunctive normal form. In general this is a critical step, since it can result in an exponential increase in the size of the original formula.
Socher, Rolf
openaire   +2 more sources

The decision problem for formulas in prenex conjunctive normal form with binary disjunctions

Journal of Symbolic Logic, 1970
In [8] S. J. Maslov gives a positive solution to the decision problem for satisfiability of formulas of the formin any first-order predicate calculus without identity where h, k, m, n are positive integers, αi, βi are signed atomic formulas (atomic formulas or negations of atomic formulas), and ∧, ∨ are conjunction and disjunction symbols, respectively
M. Krom
openaire   +2 more sources

DADCNF: Diagnoser design for Duplicate Address Detection threat using Conjunctive Normal Form

Computer Networks, 2023
Santosh Biswas, Abhay Deep Seth
exaly   +2 more sources

Satisfiability problem: Some polynomial classes of conjunctive normal forms

Cybernetics and Systems Analysis, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited

2005
Nikolai K. Kossovsky, A. B. Prokhoroff
exaly   +2 more sources