Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

A cyclic proof system, called $$ \mathtt{CLKID}^\omega $$, gives us another way of representing inductive definitions and… Expand

Is this relevant?

2011

2011

Attribute reduction is very important in rough set-based data analysis (RSDA) because it can be used to simplify the induced… Expand

Is this relevant?

2009

2009

We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for… Expand

Is this relevant?

2003

2003

Equational problems (i.e. first-order formulae with quantifier prefix ∃* ∀*, whose only predicate symbol is syntactic equality… Expand

Is this relevant?

2001

2001

In the paper, we present declarative, model, and fixpoint semantics for fuzzy disjunctive programs with weak similarity — sets of… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

set of n-tuples description Vw(λ~x.φ) {w | Vw(λ~x.φ) = E} (E ⊆ Dn) question proposition partition answerhood {v | Vv(λ~x.φ) = Vw… Expand

Is this relevant?

1998

1998

We present a method to systematically detect feature interactions in requirements. The requirements are expressed as constraints… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension… Expand

Is this relevant?

1989

1989

Recall that a theory is said to be almost strongly minimal if in every model every element is in the algebraic closure of a… Expand

Is this relevant?

1963

1963

In a work widely quoted and applied, 3 Craig has shown that if A and C are any formulas of predicate logic such that A├C, then… Expand

Is this relevant?