SCOPUS 정보 검색 플랫폼

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 738-741

Tascpl: TAS solver for classical propositional logic

(2) Ojeda Aciego, M a Valverde, A a

a UNIVERSITY OF MÁLAGA (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ALGORITHMS; BOOLEAN ALGEBRA; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

CLASSICAL PROPOSITIONAL LOGIC; NORMAL FORM; REDUCTION STRATEGY; SAT PROBLEMS; SATISFIABILITY; SEARCH SPACES; TAS SOLVER; TREE REPRESENTATION; EQUISATISFIABILITY TRANSFORMATION; PROPOSITIONAL LOGIC;

FORMAL LOGIC; LOGIC PROGRAMMING;

EID: 22944452440 PISSN: 03029743 EISSN: None Source Type: Conference Proceeding
DOI: 10.1007/978-3-540-30227-8_70 Document Type: Conference Paper

Times cited : (1)

References (6)

1
- 0035817890
- Reductions for non-clausal theorem proving
- G. Aguilera, I. P. De Guzmán, M. Ojeda-Aciego, and A. Valverde. Reductions for non-clausal theorem proving. Theoretical Computer Science, 266(1/2):81-112, 2001.
- (2001) Theoretical Computer Science , vol.266 , Issue.1-2 , pp. 81-112
- Aguilera, G.¹ De Guzmán, I.P.² Ojeda-Aciego, M.³ Valverde, A.⁴

2
- 0033274027
- Implicates and reduction techniques for temporal logics
- I. P. De Guzmán, M. Ojeda-Aciego, and A. Valverde. Implicates and reduction techniques for temporal logics. Annals of Mathematics and Artificial Intelligence, 27:2-23, 1999.
- (1999) Annals of Mathematics and Artificial Intelligence , vol.27 , pp. 2-23
- De Guzmán, I.P.¹ Ojeda-Aciego, M.² Valverde, A.³

3
- 23044534340
- Restricted Δ-trees and reduction theorems in multiple-valued logics
- I. P. De Guzmán, M. Ojeda-Aciego, and A. Valverde. Restricted Δ-trees and reduction theorems in multiple-valued logics. Lecture Notes in Artificial Intelligence 2527:161-171, 2002.
- (2002) Lecture Notes in Artificial Intelligence , vol.2527 , pp. 161-171
- De Guzmán, I.P.¹ Ojeda-Aciego, M.² Valverde, A.³

4
- 84867787499
- Evaluating search heuristics and optimization techniques in propositional satisfiability
- E. Giunchiglia, M. Maratea, A. Tacchella, and D. Zambonin. Evaluating search heuristics and optimization techniques in propositional satisfiability. Lecture Notes in Computer Science 2083:341-363, 2001.
- (2001) Lecture Notes in Computer Science , vol.2083 , pp. 341-363
- Giunchiglia, E.¹ Maratea, M.² Tacchella, A.³ Zambonin, D.⁴

5
- 0042851778
- The propositional formula checker HeerHugo
- I. Gent, H. van Maaren, and T. Walsh, editors, Frontiers in Artificial Intelligence and Applications, Kluwer Academic
- J. F. Groote and J. P. Warners. The propositional formula checker HeerHugo. In I. Gent, H. van Maaren, and T. Walsh, editors, SAT2000: Highlights of Satisfiability Research in the year 2000, Frontiers in Artificial Intelligence and Applications, pages 261-281. Kluwer Academic, 2000.
- (2000) SAT2000: Highlights of Satisfiability Research in the Year 2000 , pp. 261-281
- Groote, J.F.¹ Warners, J.P.²

6
- 18544388771
- Satisfiability testing for Boolean formulas using Δ-trees
- G. Gutiérrez, I. P. De Guzmán, J. Martínez, M. Ojeda-Aciego, and A. Valverde. Satisfiability testing for Boolean formulas using Δ-trees. Studia Logica, 72:33-60, 2002.
- (2002) Studia Logica , vol.72 , pp. 33-60
- Gutiérrez, G.¹ De Guzmán, I.P.² Martínez, J.³ Ojeda-Aciego, M.⁴ Valverde, A.⁵

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.