[图书][B] Investigations into the complexity of some propositional calculi
M D'Agostino - 1990 - researchgate.net
Cut-free Gentzen systems and their semantic-oriented variant, the tableau method,
constitute an established paradigm in proof-theory and are of considerable interest for …
constitute an established paradigm in proof-theory and are of considerable interest for …
[图书][B] The logical approach to syntax: foundations, specifications, and implementations of theories of government and binding
EP Stabler - 1992 - books.google.com
By formalizing recent syntactic theories for natural languages Stabler shows how their
complexity can be handled without guesswork or oversimplification. By formalizing recent …
complexity can be handled without guesswork or oversimplification. By formalizing recent …
Unification et disunification: Théorie et applications
H Comon - 1988 - theses.hal.science
Les règles de transformation des problèmes equationnels sont donnes permettant, en
particulier, de décider de l'existence d'une solution fermée. Comme première application, il …
particulier, de décider de l'existence d'une solution fermée. Comme première application, il …
Logics for reasoning about knowledge and belief
H Reichgelt - The Knowledge Engineering Review, 1989 - cambridge.org
AI researchers are becoming increasingly aware of the importance of reasoning about
knowledge and belief. This paper reviews epistemic logic, a logic designed specifically for …
knowledge and belief. This paper reviews epistemic logic, a logic designed specifically for …
CHCL—A connectionist inference system
S Hölldobler, F Kurfeß - … Dagstuhl Castle, Germany, December 17–18 …, 2005 - Springer
CHCL — A connectionist inference system Page 1 CHCL- A Connectionist Inference
System Steffen HSlldobler FG Intellektik, FB Informatik TIt Darmstadt Alexanderstraf~e 10 D-6100 …
System Steffen HSlldobler FG Intellektik, FB Informatik TIt Darmstadt Alexanderstraf~e 10 D-6100 …
Proving termination properties of Prolog programs: A semantic approach
M Baudinet - The Journal of Logic Programming, 1992 - Elsevier
In this paper, we define a framework in which the termination of Prolog programs can be
proved. This framework relies on a semantics of Prolog that takes Prolog's control into …
proved. This framework relies on a semantics of Prolog that takes Prolog's control into …
[图书][B] Many-valued logics 2: Automated reasoning and practical applications
L Bolc, P Borowik - 2003 - books.google.com
Many-valued logics are becoming increasingly important in all areas of computer science.
This is the second volume of an authoritative two-volume handbook on many valued logics …
This is the second volume of an authoritative two-volume handbook on many valued logics …
Logic engineering in medicine
PJF Lucas - The knowledge Engineering review, 1995 - cambridge.org
The safety-critical nature of the application of knowledge-based systems to the field of
medicine requires the adoption of reliable engineering principles with a solid foundation for …
medicine requires the adoption of reliable engineering principles with a solid foundation for …
Negation in logic programming: A formalization in constructive logic
F Bry - Workshop on Information Systems and Artificial …, 1990 - Springer
The conventional formalization of logic programming in classical logic explains very
convincingly the basic principles of this programming style. However, it gives no easy or …
convincingly the basic principles of this programming style. However, it gives no easy or …
Unrestricted resolution versus N-resolution
A Goerdt - Theoretical Computer Science, 1992 - Elsevier
An N-resolution proof is a resolution proof in which the resolution rule is restricted: one
clause to which it is applied must only consist of negative literals. N-resolution is complete …
clause to which it is applied must only consist of negative literals. N-resolution is complete …