Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X)

Research output: Contribution to report/book/conference proceedingsIn-proceedings paper

Standard

Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X). / He, Xingxing; Xu, Yang; Li, Yingfang; Liu, Jun; Martinez, Luis; Ruan, Da; Wagemans, Jan (Peer reviewer).

Hybrid Artificial Intelligence Systems. Vol. 2 Heidelberg, Germany, 2010. p. 320-327 (Lecture Notes in Artificial Intelligence; No. 6077).

Research output: Contribution to report/book/conference proceedingsIn-proceedings paper

Harvard

He, X, Xu, Y, Li, Y, Liu, J, Martinez, L, Ruan, D & Wagemans, J 2010, Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X). in Hybrid Artificial Intelligence Systems. vol. 2, Lecture Notes in Artificial Intelligence, no. 6077, Heidelberg, Germany, pp. 320-327, Hybrid Artificial Intelligence Systems, San Sebastián, Spain, 2010-06-23.

APA

He, X., Xu, Y., Li, Y., Liu, J., Martinez, L., Ruan, D., & Wagemans, J. (2010). Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X). In Hybrid Artificial Intelligence Systems (Vol. 2, pp. 320-327). (Lecture Notes in Artificial Intelligence; No. 6077). Heidelberg, Germany.

Vancouver

He X, Xu Y, Li Y, Liu J, Martinez L, Ruan D et al. Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X). In Hybrid Artificial Intelligence Systems. Vol. 2. Heidelberg, Germany. 2010. p. 320-327. (Lecture Notes in Artificial Intelligence; 6077).

Author

He, Xingxing ; Xu, Yang ; Li, Yingfang ; Liu, Jun ; Martinez, Luis ; Ruan, Da ; Wagemans, Jan. / Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X). Hybrid Artificial Intelligence Systems. Vol. 2 Heidelberg, Germany, 2010. pp. 320-327 (Lecture Notes in Artificial Intelligence; 6077).

Bibtex - Download

@inproceedings{bd9d63b5fe734f59ad71ff68f6933cee,
title = "Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X)",
abstract = "This paper focuses on some automated reasoning issues for a kind of lattice-valued logic LP(X) based on lattice-valued algebra. Firstly some extended strategies from classical logic to LP(X) are investigated in order to verify theAlpha-satisability of formulae in LP(X) while the main focus is given on the role of constant formula played in LP(X) in order to simply the verication procedure in the semantic level. Then, an alpha-lock resolution method in LP(X) is proposed and the weak completeness of this method is proved. The work will provide a support for the more e±cient resolution based automated reasoning in LP(X).",
keywords = "lattice-valued logic, Alpha-resolution principle, Alpha-satisability, ALpha-lock resolution method",
author = "Xingxing He and Yang Xu and Yingfang Li and Jun Liu and Luis Martinez and Da Ruan and Jan Wagemans",
note = "Score = 3",
year = "2010",
month = "6",
language = "English",
isbn = "978-3-642-13802-7",
volume = "2",
series = "Lecture Notes in Artificial Intelligence",
number = "6077",
pages = "320--327",
booktitle = "Hybrid Artificial Intelligence Systems",

}

RIS - Download

TY - GEN

T1 - Alpha-satisfiability and alpha-lock resolution for a lattice-valued logic LP(X)

AU - He, Xingxing

AU - Xu, Yang

AU - Li, Yingfang

AU - Liu, Jun

AU - Martinez, Luis

AU - Ruan, Da

A2 - Wagemans, Jan

N1 - Score = 3

PY - 2010/6

Y1 - 2010/6

N2 - This paper focuses on some automated reasoning issues for a kind of lattice-valued logic LP(X) based on lattice-valued algebra. Firstly some extended strategies from classical logic to LP(X) are investigated in order to verify theAlpha-satisability of formulae in LP(X) while the main focus is given on the role of constant formula played in LP(X) in order to simply the verication procedure in the semantic level. Then, an alpha-lock resolution method in LP(X) is proposed and the weak completeness of this method is proved. The work will provide a support for the more e±cient resolution based automated reasoning in LP(X).

AB - This paper focuses on some automated reasoning issues for a kind of lattice-valued logic LP(X) based on lattice-valued algebra. Firstly some extended strategies from classical logic to LP(X) are investigated in order to verify theAlpha-satisability of formulae in LP(X) while the main focus is given on the role of constant formula played in LP(X) in order to simply the verication procedure in the semantic level. Then, an alpha-lock resolution method in LP(X) is proposed and the weak completeness of this method is proved. The work will provide a support for the more e±cient resolution based automated reasoning in LP(X).

KW - lattice-valued logic

KW - Alpha-resolution principle

KW - Alpha-satisability

KW - ALpha-lock resolution method

UR - http://ecm.sckcen.be/OTCS/llisapi.dll/open/ezp_111341

UR - http://ecm.sckcen.be/OTCS/llisapi.dll/open/ezp_111341_2

UR - http://knowledgecentre.sckcen.be/so2/bibref/7764

M3 - In-proceedings paper

SN - 978-3-642-13802-7

VL - 2

T3 - Lecture Notes in Artificial Intelligence

SP - 320

EP - 327

BT - Hybrid Artificial Intelligence Systems

CY - Heidelberg, Germany

ER -

ID: 60722