You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (167)

Journals (0)

1-10 of 167 results for Well-Founded Semantics

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Well-Founded Semantics for Default Logic

Retricted access

Research article

First published 1997-9

Well-Founded Semantics for Default Logic

Gerhard Brewka, Georg Gottlob

Fundamenta Informaticae

Select article: Query Compilation under the disjunctive well-founded semantics

Retricted access

Research article

First published 2004-10

Query Compilation under the disjunctive well-founded semantics

Chris A. Johnson

Fundamenta Informaticae

Select article: Well-Founded Semantics Coincides with Three-Valued Stable Semantics 1

Retricted access

Research article

First published 1990

Well-Founded Semantics Coincides with Three-Valued Stable Semantics 1

Teodor Przymusinski

Fundamenta Informaticae

Select article: A New Partial Semantics for Disjunctive Deductive Databases

Retricted access

Research article

First published 2005-9

A New Partial Semantics for Disjunctive Deductive Databases

Françoise Gire, Corinne Plourde

Fundamenta Informaticae

Select article: A Possibilistic Argumentation Decision Making Framework with Default Reasoning

Retricted access

Research article

First published 2011-11

A Possibilistic Argumentation Decision Making Framework with Default Reasoning

Juan Carlos Nieves, Roberto Confalonieri

Fundamenta Informaticae

Select article: SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions

Retricted access

Research article

First published 2010-8

SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions

Fabrizio Riguzzi

Fundamenta Informaticae

Select article: Approximating the Stable Model Semantics is Hard

Free access

Research article

First published 1996-11

Approximating the Stable Model Semantics is Hard

Georg Gottlob, Mirosław Truszczyński

Fundamenta Informaticae

Select article: A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: II. WEAK PROPERTIES

Retricted access

Research article

First published 1995-3

A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: II. WEAK PROPERTIES

Jürgen DIX

Fundamenta Informaticae

Select article: A first‐order representation of stable models[1]A preliminary version of this paper has appeared in: Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’97),J. Dix,U. Furbach and A. Nerode,eds,LNCS 1265,Springer,1997.

Retricted access

Research article

First published 1998-2

A first‐order representation of stable models[1]A preliminary version of this paper has appeared in: Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’97),J. Dix,U. Furbach and A. Nerode,eds,LNCS 1265,Springer,1997.

Thomas Eiter, James Lu, V.S. Subrahmanian

The European Journal on Artificial Intelligence

Select article: Representing the semantics of abstract dialectical frameworks based on arguments and attacks

Open access

Research article

First published 2018-11-12

Representing the semantics of abstract dialectical frameworks based on arguments and attacks

Phan Minh Dung, Phan Minh Thang

Argument & Computation

1
2
3
•••
17
10 / page

Article type

Publication date

Subjects

Access