The following pages link to Andrzej Szałas (Q763332):
Displayed 50 items.
- ExpTime tableau decision procedures for regular grammar logics with converse (Q763333) (← links)
- Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic (Q985144) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- (Q1090672) (redirect page) (← links)
- Concerning the semantic consequence relation in first-order temporal logic (Q1090673) (← links)
- Arithmetical axiomatization of first-order temporal logic (Q1101100) (← links)
- A complete axiomatic characterization of first-order temporal logic of linear time (Q1102941) (← links)
- Propositional description of finite cause-effect structures (Q1111370) (← links)
- An incompleteness result in process algebra (Q1113665) (← links)
- Incompleteness of first-order temporal logic with until (Q1123184) (← links)
- Axiomatizing fixpoint logics (Q1190508) (← links)
- Computing circumscription revisited: A reduction algorithm (Q1367072) (← links)
- Rough forgetting (Q2096552) (← links)
- Rough set reasoning using answer set programs (Q2237125) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- On strictly arithmetical completeness in logics of programs (Q2277248) (← links)
- A paraconsistent approach to actions in informationally complex environments (Q2330540) (← links)
- Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals (Q2462670) (← links)
- Knowledge representation techniques. A rough set approach. (Q2498271) (← links)
- Many-valued dynamic object-oriented inheritance and approximations (Q2670890) (← links)
- (Q2753783) (← links)
- Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs (Q2835899) (← links)
- Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination (Q2865084) (← links)
- Converse-PDL with regular inclusion axioms: a framework for MAS logics (Q2901207) (← links)
- Logical foundations and complexity of 4QL, a query language with unrestricted negation (Q2901212) (← links)
- Checking Consistency of an ABox w.r.t. Global Assumptions in PDL (Q3008108) (← links)
- Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{SH}$ (Q3052749) (← links)
- Contextual Coalitional Games (Q3063970) (← links)
- A Framework for Graded Beliefs, Goals and Intentions (Q3065011) (← links)
- (Q3126169) (← links)
- (Q3339269) (← links)
- Rule-Based Reasoning with Belief Structures (Q3388213) (← links)
- (Q3425577) (← links)
- Towards Approximate BGI Systems (Q3527274) (← links)
- Paraconsistent Logic Programs with Four-Valued Rough Sets (Q3541044) (← links)
- (Q3543581) (← links)
- A Four-Valued Logic for Rough Set-Like Approximate Reasoning (Q3591001) (← links)
- Towards incorporating background theories into quantifier elimination (Q3643319) (← links)
- Paraconsistent Reasoning with Words (Q3644709) (← links)
- Second-order reasoning in description logics (Q3647253) (← links)
- Approximate databases: a support tool for approximate reasoning (Q3647257) (← links)
- (Q3678648) (← links)
- (Q3769950) (← links)
- (Q3835444) (← links)
- (Q3957924) (← links)
- (Q4250040) (← links)
- (Q4264098) (← links)
- On the Correspondence Between Modal and Classical Logic: an Automated Approach (Q4286209) (← links)
- On an automated translation of modal proof rules into formulas of the classical logic (Q4317726) (← links)
- (Q4329266) (← links)