Complexity of power default reasoning

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 1997, Pages 328-339

  Zhang, Guo Qiang ^a   Rounds, William C ^a  

^a UNIVERSITY OF GEORGIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; INFERENCE ENGINES; THEOREM PROVING;

PROPOSITIONAL DEFAULT LOGIC; SCOTT'S DOMAIN THEORY;

FORMAL LOGIC;

EID: 0030654537     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)