Results 321 to 330 of about 8,631,344 (363)

Generalized Possibilistic Logic

2011
Usual propositional possibilistic logic formulas are pairs made of a classical logic formula associated with a weight thought of as a lower bound of its necessity measure. In standard possibilistic logic, only conjunctions of such weighted formulas are allowed (a weighted classical conjunction is equivalent to the conjunction of its weighted conjuncts,
Didier Dubois, Henri Prade
openaire   +2 more sources

Programming by Combining General Logic Programs

Journal of Logic and Computation, 1997
Antonio Brogi, S. Contiero, F. Turini
semanticscholar   +1 more source

A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics

New generation computing, 1990
F. Fages
semanticscholar   +1 more source

A generalization of modal logic [PDF]

Studia Logica, 1971
openaire   +1 more source

Composing General Logic Programs

International Conference on Logic Programming and Non-Monotonic Reasoning, 1997
Antonio Brogi, S. Contiero, F. Turini
semanticscholar   +1 more source

Knowledge Visualization Using Optimized General Logic Diagrams

Intelligent Information Systems, 2005
B. Sniezynski, R. Szymacha, R. Michalski
semanticscholar   +1 more source

Nothing More or Less than Logic: General Logic, Transcendental Philosophy, and Kant's Repudiation of Fichte's Wissenschaftslehre

, 2003
Wayne Martin
semanticscholar   +1 more source

On “Generalized logics”

Studia Logica, 1974
openaire   +3 more sources

A Correct Goal-directed Proof Procedure for a General Logic Program with Integrity Constraints

Extensions of Logic Programming, 1992
K. Satoh, Noboru Iwayama
semanticscholar   +1 more source

Generating schematic logic

1996
The process structure, together with the conditions and operations that have been allocated, is converted into schematic logic. Keywords are used to identify each of the constructs.
openaire   +2 more sources